11-22-2014, 04:17 PM
From the Online Encyclopaedia of Integer Sequences:
A028907 Arrange digits of squares in ascending order.
0, 1, 4, 9, 16, 25, 36, 49, 46, 18, 1, 112, 144, 169, 169, 225, 256, 289, 234, 136, 4, 144, 448, 259, 567, 256, 667, 279, 478, 148, 9, 169
Just for fun on the 49G, works with Vers 1.19-6 & 2.10-7:
::
CK1&Dispatch
# FF
::
FPTR2 ^DupQIsZero?
?SEMI
NULL$SWAP
FPTR2 ^ZSQ_
FPTR2 ^Z>S
BINT10
ONE_DO
INDEX@
#>$
NULL$
FPTR F 1A
COERCEDUP
#0=ITE
DROP
::
ROTSWAP
ZERO_DO
JINDEX@
#>$
&$
LOOP
SWAP
;
LOOP
DROP
FPTR2 ^S>Z
;
;
@
Enter the index & the value is returned.
A028907 Arrange digits of squares in ascending order.
0, 1, 4, 9, 16, 25, 36, 49, 46, 18, 1, 112, 144, 169, 169, 225, 256, 289, 234, 136, 4, 144, 448, 259, 567, 256, 667, 279, 478, 148, 9, 169
Just for fun on the 49G, works with Vers 1.19-6 & 2.10-7:
::
CK1&Dispatch
# FF
::
FPTR2 ^DupQIsZero?
?SEMI
NULL$SWAP
FPTR2 ^ZSQ_
FPTR2 ^Z>S
BINT10
ONE_DO
INDEX@
#>$
NULL$
FPTR F 1A
COERCEDUP
#0=ITE
DROP
::
ROTSWAP
ZERO_DO
JINDEX@
#>$
&$
LOOP
SWAP
;
LOOP
DROP
FPTR2 ^S>Z
;
;
@
Enter the index & the value is returned.