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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128935 Fibonacci(5^n) / 5^n. 2
1, 1, 3001, 475400918060101145703001, 29642179764875707696452732234250095350341524541114277856812964100763567848899514572925690068090872073476146381237687662210078001 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Numbers n such that n divides Fibonacci(n) are listed in A023172(n) = {1,5,12,24,25,36,48,60,72,96,108,120,125,...}. All powers of 5 belong to A023172(n). 5^n divides Fibonacci(5^n). Mod[ a(n), 1000 ] = 1. a(n+1)/a(n) = {1, 3001, 158414167964045700001, 62351961552434956321060201440347372028390478647963811251289490034177804212636326088548682319305439375001, ...}.

FORMULA

a(n) = Fibonacci[ 5^n ] / 5^n.

MATHEMATICA

Table[ Fibonacci[ 5^n ] / 5^n, {n, 0, 4} ]

CROSSREFS

Cf. A023172, A121169, A121170, A058635, A045529.

Sequence in context: A158861 A202097 A156655 * A145304 A094336 A100896

Adjacent sequences:  A128932 A128933 A128934 * A128936 A128937 A128938

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), May 11 2007

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 17 21:13 EST 2012. Contains 206085 sequences.