The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121169 Largest prime divisor of Fibonacci(100*n). 1
 570601, 5738108801, 87129547172401, 3160438834174817356001, 158414167964045700001, 87129547172401, 7358192362316341243805801, 7601587101128729489773008667804801, 427694148584338087778220001 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Most prime divisors of Fibonacci(100*n) are congruent to 1 mod 10 (final digit is 1). It appears that a(n) == 1 (mod 100) for all n. LINKS Table of n, a(n) for n=1..9. 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, 10}] PROG (PARI) a(n) = my(f=factor(fibonacci(100*n))[, 1]); f[#f]; \\ Jinyuan Wang, Mar 17 2020 CROSSREFS Cf. A000045, A060385. Sequence in context: A068724 A233651 A288085 * A237173 A090061 A146947 Adjacent sequences: A121166 A121167 A121168 * A121170 A121171 A121172 KEYWORD nonn AUTHOR Alexander Adamchuk, Aug 14 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 06:16 EST 2024. Contains 370219 sequences. (Running on oeis4.)