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.

A114815 Indices of Fibonacci numbers with 6 prime factors when counted with multiplicity.

This page as a plain text file.
%I A114815 #22 May 05 2024 19:20:37
%S A114815 12,40,50,64,75,92,95,99,116,117,129,133,153,155,159,177,188,194,205,
%T A114815 206,219,237,245,265,278,314,323,327,339,341,343,346,356,358,361,362,
%U A114815 394,407,411,417,422,427,437,446,454,466,482,502,503,505,514,515,527
%N A114815 Indices of Fibonacci numbers with 6 prime factors when counted with multiplicity.
%H A114815 Amiram Eldar, <a href="/A114815/b114815.txt">Table of n, a(n) for n = 1..120</a>
%H A114815 Blair Kelly, <a href="http://mersennus.net/fibonacci/">Fibonacci and Lucas Factorizations</a>.
%e A114815 a(1)=12 because 12th Fibonacci number (i.e., 144) consists of 6 prime factors (i.e., 2*2*2*2*3*3).
%t A114815 t = {}; Do[f = FactorInteger[Fibonacci[n]]; If[Total[Transpose[f][[2]]] == 6, AppendTo[t, n]], {n, 2, 100}]; t (* _T. D. Noe_, Mar 14 2014 *)
%t A114815 Position[Fibonacci[Range[550]],_?(PrimeOmega[#]==6&)]//Flatten (* _Harvey P. Dale_, Jun 12 2017 *)
%o A114815 (PARI) n=1;while(n<330,if(bigomega(fibonacci(n))==6,print1(n,", "));n++)
%Y A114815 Column k=6 of A303215.
%K A114815 nonn
%O A114815 1,1
%A A114815 _Shyam Sunder Gupta_, Feb 19 2006
%E A114815 More terms from _Ryan Propper_, May 22 2006