Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121170
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121170 Largest prime divisor of Fibonacci[5n]. +0
2
5, 11, 61, 41, 3001, 61, 141961, 2161, 109441, 3001, 474541, 2521, 14736206161, 141961, 230686501, 3041, 3415914041, 109441, 67735001, 570601, 8288823481, 474541, 2441738887963981, 20641, 158414167964045700001, 14736206161 (list; graph; listen)
OFFSET

1,1

COMMENT

Except from a(1) = 5 all a(n) are congruent to 1, Mod 10 (final digit is 1). Final digit of most prime divisors of F(5n) is 1.

EXAMPLE

a(2) = 11 because F(10)= 5 * 11.

a(4) = 41 because F(20)= 3 * 5 * 11 * 41.

a(10) = 3001 because F(50)= 5^2 * 11 * 101 * 151 * 3001.

a(25) = 158414167964045700001 because F(125)= 5^3 * 3001 * 158414167964045700001.

MATHEMATICA

Table[Max[Flatten[FactorInteger[Fibonacci[5n]]]], {n, 1, 50}]

CROSSREFS

Cf. A000045.

Sequence in context: A057822 A095150 A041697 this_sequence A101209 A050568 A065555

Adjacent sequences: A121167 A121168 A121169 this_sequence A121171 A121172 A121173

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research