The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072397 Smallest Fibonacci number with n prime factors when counted with multiplicity. 5
 2, 21, 8, 6765, 2584, 144, 832040, 86267571272, 46368, 14930352, 30960598847965113057878492344, 4807526976, 160500643816367088, 498454011879264, 16641027750620563662096, 51680708854858323072, 34507973060837282187130139035400899082304280 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..17. Hisanori Mishima, Fibonacci numbers (n = 1 to 100). Hisanori Mishima, Fibonacci numbers (n = 101 to 200). Hisanori Mishima, Fibonacci numbers (n = 201 to 300). Hisanori Mishima, Fibonacci numbers (n = 301 to 400). Hisanori Mishima, Fibonacci numbers (n = 401 to 480). FORMULA a(n) = A000045(A072396(n)). - Alois P. Heinz, Apr 10 2018 EXAMPLE 21 is the 2nd term because 21 is the smallest Fibonacci number having 2 prime factors. CROSSREFS Cf. A000045, A072396. Row n=1 of A303216. Sequence in context: A105666 A058261 A298822 * A077208 A321534 A212483 Adjacent sequences: A072394 A072395 A072396 * A072398 A072399 A072400 KEYWORD nonn AUTHOR Shyam Sunder Gupta, Jul 21 2002 EXTENSIONS a(17) from Alois P. Heinz, Apr 10 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 17:15 EDT 2024. Contains 373391 sequences. (Running on oeis4.)