cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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).

Original entry on oeis.org

1, 0, 4, 27, 625, 32, 4826809, 63, 64, 625, 31181719929966183601, 27, 25601832525455335435322705761, 317057, 80, 343, 1790105629031753086880980667661321707396108307827521, 272, 1975325993
Offset: 1

Views

Author

Jason Earls, Aug 15 2006

Keywords

Comments

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

Examples

			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.