|
Search: id:A000350
|
|
|
| A000350 |
|
Numbers n such that Fibonacci(n) ends with n.
(Formerly M3935 N1619)
|
|
+0
7
|
|
| 0, 1, 5, 25, 29, 41, 49, 61, 65, 85, 89, 101, 125, 145, 149, 245, 265, 365, 385, 485, 505, 601, 605, 625, 649, 701, 725, 745, 749, 845, 865, 965, 985, 1105, 1205, 1249, 1345, 1445, 1585, 1685, 1825, 1925, 2065, 2165, 2305, 2405, 2501, 2545, 2645, 2785, 2885
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Conjecture: Other than 1 and 5, there is no n such that Fibonacci(n) in binary ends with n in binary. The conjecture holds up to n=50000. - R Stephan, Aug 21 2006
The conjecture for binary numbers holds for n < 2^25. - T. D. Noe, May 14 2007
|
|
REFERENCES
|
M. Dunton and R. E. Grimm, Fibonacci on Egyptian fractions, Fib. Quart., 4 (1966), 339-354.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..803
Index entries for sequences related to Egyptian fractions
|
|
EXAMPLE
|
Fibonacci(25) = 75025 ends with 25.
|
|
MATHEMATICA
|
a=0; b=1; c=1; Do[a=b; b=c; c=a+b; m=Floor[N[Log[10, n]]]+1; If[Mod[c, 10^m]==n, Print[n]], {n, 3, 5000} ]
|
|
CROSSREFS
|
Cf. A000045, A050816, A038546, A052000, A023172.
Sequence in context: A036137 A070380 A068574 this_sequence A000221 A018612 A036127
Adjacent sequences: A000347 A000348 A000349 this_sequence A000351 A000352 A000353
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
