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.

A114839 Indices of Fibonacci numbers with 6 distinct prime factors.

Original entry on oeis.org

40, 48, 54, 56, 64, 78, 92, 95, 99, 102, 116, 117, 129, 133, 155, 159, 175, 177, 188, 194, 205, 206, 219, 237, 245, 265, 278, 314, 323, 327, 339, 341, 343, 346, 356, 358, 361, 362, 394, 407, 411, 417, 422, 427, 437, 446, 454, 466, 482, 502, 503, 505, 514, 515, 527, 535, 542, 545, 551, 562, 573, 577, 583, 593, 607, 614, 622, 623, 625, 634, 655, 662, 667, 674, 713, 727, 731, 769, 781, 789, 791, 803, 809, 821, 835, 893, 917, 919, 974, 977, 982, 993, 995, 1013, 1039, 1047, 1057, 1081, 1097, 1103, 1121, 1138, 1151, 1165, 1172, 1202, 1203
Offset: 1

Views

Author

Shyam Sunder Gupta, Feb 19 2006

Keywords

Comments

Numbers n such that A000045(n) is in A046306.

Examples

			a(1) = 40 because 40th Fibonacci number consists of 6 distinct prime factors (i.e., 102334155 = 3 x 5 x 7 x 11 x 41 x 2161).
a(31) = 341 because F(341)= 89 * 557 * 2417 * 761227665342913 * 197907695243868721 * 4558282384863830955384586674337 has exactly 6 prime factors.
		

Crossrefs

Column k=6 of A303217.

Programs

  • PARI
    n=1;while(n<330,if(omega(fibonacci(n))==6,print1(n,", "));n++)

Extensions

More terms from Jonathan Vos Post, Mar 22 2006
Corrected by Ryan Propper, Apr 26 2006
a(55)-a(107) from Max Alekseyev, Aug 18 2013