|
Search: id:A121169
|
|
|
| A121169 |
|
Largest prime divisor of Fibonacci[100n]. |
|
+0
2
|
|
| 570601, 5738108801, 87129547172401, 3160438834174817356001, 158414167964045700001, 87129547172401, 7358192362316341243805801, 7601587101128729489773008667804801, 427694148584338087778220001
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Most prime divisors of F(100n) are congruent to 1, Mod 10 (final digit is 1). It appears that Mod[a(n),100] = 1 for all n.
|
|
EXAMPLE
|
a(1) = 570601 because F(100)= 3 * 5^2 * 11 * 41 * 101 * 151 * 401 * 3001 * 570601.
a(10) = 9372625568572722938847095612481183137496995522804466421273200001 because F(1000)= 3 * 5^3 * 7 * 11 * 41 * 101 * 151 * 251 * 401 * 2161 * 3001 * 4001 * 570601 * 9125201 * 112128001 * 1353439001 * 5738108801 * 28143378001 * 5465167948001 * 10496059430146001 * 84817574770589638001 * 158414167964045700001 * 9372625568572722938847095612481183137496995522804466421273200001.
|
|
MATHEMATICA
|
Table[Max[Flatten[FactorInteger[Fibonacci[100n]]]], {n, 1, 10}]
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A124514 A100416 A068724 this_sequence A090061 A119402 A050518
Adjacent sequences: A121166 A121167 A121168 this_sequence A121170 A121171 A121172
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 14 2006
|
|
|
Search completed in 0.002 seconds
|
