|
Search: id:A085315
|
|
|
| A085315 |
|
Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10. |
|
+0
3
|
|
| 1, 2, 7, 11, 101, 111, 1001, 1011, 1101, 10001, 10011, 10101, 11001, 11011, 100001, 100011, 100101, 100111, 101001, 101011, 101101, 110001, 110011, 110101, 111001, 1000001, 1000011, 1000101, 1000111, 1001001, 1001011, 1001101, 1010001
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Solutions to rev[x^3]=rev[x]^3 without numbers divisible by 10.
|
|
EXAMPLE
|
n=100111,rev[n]=111001, n^3=1003333697667631
rev[n^3]=111001^3=1367667963333001=rev[n]^3
|
|
MATHEMATICA
|
nd[x_, y_] := 10*x+y; tn[x_] := Fold[nd, 0, x] rt[x_] := tn[Reverse[IntegerDigits[x]]] Do[s=rt[n^3]; s1=rt[n]^3; If[Equal[s, s1]&& !Equal[Mod[n, 10], 0], k=k+1; Print[n]], {n, 1, 10000000}]; k
|
|
CROSSREFS
|
Cf. A085305.
Sequence in context: A073623 A101592 A135066 this_sequence A002780 A069885 A069748
Adjacent sequences: A085312 A085313 A085314 this_sequence A085316 A085317 A085318
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 01 2003
|
|
|
Search completed in 0.002 seconds
|
