login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121169 Largest prime divisor of Fibonacci[100n]. 1
570601, 5738108801, 87129547172401, 3160438834174817356001, 158414167964045700001, 87129547172401, 7358192362316341243805801, 7601587101128729489773008667804801, 427694148584338087778220001 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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.

FORMULA

a(n) = A060385(100*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: A151878 A156412 A068724 * A090061 A146947 A206106

Adjacent sequences:  A121166 A121167 A121168 * A121170 A121171 A121172

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 14 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:22 EST 2012. Contains 205835 sequences.