TI-BASIC (TI-83 Plus), 115 bytes
not my proudest one.
Input I
1→O
While I
O+2→O
O-1→N
For(A,N-1,2,-1
N/A→Z
If not(fPart(Z
Then
sum(not(fPart(seq(Z/B,B,2,Z→C
If C=1
Z→U
End
End
If sum(seq(U=10^(E)fPart(O/10^(E)),E,1,1+log(O
Then
Disp O
I-1→I
End
End
Keep in mind this is EXTREMELY SLOW.
this is 1-indexed
TI-BASIC (TI-83 Plus), 115 bytes
not my proudest one.
Input I
1→O
While I
O+2→O
O-1→N
For(A,N-1,2,-1
N/A→Z
If not(fPart(Z
Then
sum(not(fPart(seq(Z/B,B,2,Z→C
If C=1
Z→U
End
End
If sum(seq(U=10^(E)fPart(O/10^(E)),E,1,1+log(O
Then
Disp O
I-1→I
End
End
Keep in mind this is EXTREMELY SLOW.
TI-BASIC (TI-83 Plus), 115 bytes
not my proudest one.
Input I
1→O
While I
O+2→O
O-1→N
For(A,N-1,2,-1
N/A→Z
If not(fPart(Z
Then
sum(not(fPart(seq(Z/B,B,2,Z→C
If C=1
Z→U
End
End
If sum(seq(U=10^(E)fPart(O/10^(E)),E,1,1+log(O
Then
Disp O
I-1→I
End
End
Keep in mind this is EXTREMELY SLOW.
this is 1-indexed
TI-BASIC (TI-83 Plus), 115 bytes
not my proudest one.
Input I
1→O
While I
O+2→O
O-1→N
For(A,N-1,2,-1
N/A→Z
If not(fPart(Z
Then
sum(not(fPart(seq(Z/B,B,2,Z→C
If C=1
Z→U
End
End
If sum(seq(U=10^(E)fPart(O/10^(E)),E,1,1+log(O
Then
Disp O
I-1→I
End
End
Keep in mind this is EXTREMELY SLOW.