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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120093 a(n) = the n-th divisor of Fibonacci(n)^n (when the positive divisors of Fibonacci(n)^n are written in order from smallest to largest). 0
1, 0, 4, 27, 625, 32, 4826809, 63, 64, 625, 31181719929966183601, 27, 25601832525455335435322705761, 317057, 80, 343, 1790105629031753086880980667661321707396108307827521, 272, 1975325993 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

a(2)=0 because Fibonacci(2)^2=1 has no second divisor.

EXAMPLE

1, 3, 7, 9, 21, 27, 49, 63, 81, 147, 189, 243, 343, 441, 567, 729,... is the beginning of the sequence of divisors of Fibonacci(8)^8 = 37822859361. 63 is the 8th term, so a(8) = 63.

CROSSREFS

Cf. A121067.

Sequence in context: A104169 A123672 A119030 * A197987 A133018 A104168

Adjacent sequences:  A120090 A120091 A120092 * A120094 A120095 A120096

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 15 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 14 00:26 EST 2012. Contains 205567 sequences.