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.

A072397 Smallest Fibonacci number with n prime factors when counted with multiplicity.

Original entry on oeis.org

2, 21, 8, 6765, 2584, 144, 832040, 86267571272, 46368, 14930352, 30960598847965113057878492344, 4807526976, 160500643816367088, 498454011879264, 16641027750620563662096, 51680708854858323072, 34507973060837282187130139035400899082304280
Offset: 1

Views

Author

Shyam Sunder Gupta, Jul 21 2002

Keywords

Examples

			21 is the 2nd term because 21 is the smallest Fibonacci number having 2 prime factors.
		

Crossrefs

Row n=1 of A303216.

Formula

a(n) = A000045(A072396(n)). - Alois P. Heinz, Apr 10 2018

Extensions

a(17) from Alois P. Heinz, Apr 10 2018