login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114304 Numbers k such that Fibonacci(k) has more prime factors (counted with multiplicity) than k does. 1

%I

%S 6,12,15,18,19,20,21,24,25,27,28,30,31,33,35,36,37,38,39,40,41,42,44,

%T 45,46,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,

%U 70,71,72,73,74,75,76,77,78,79,80,81,82,84,85,86,87,88,89,90,91,92,93,95

%N Numbers k such that Fibonacci(k) has more prime factors (counted with multiplicity) than k does.

%H Amiram Eldar, <a href="/A114304/b114304.txt">Table of n, a(n) for n = 1..1373</a>

%e a(2) = 12 because the 12th Fibonacci number (i.e. 144) has more prime factors than 12, which has 3.

%t Select[Range[100],PrimeOmega[#]<PrimeOmega[Fibonacci[#]]&] (* _Harvey P. Dale_, Jul 14 2017 *)

%o (PARI) isok(k) = bigomega(fibonacci(k)) > bigomega(k); \\ _Michel Marcus_, Aug 26 2020

%Y Cf. A000045, A001222, A038575.

%K nonn

%O 1,1

%A _Shyam Sunder Gupta_, Feb 05 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 03:49 EDT 2021. Contains 343784 sequences. (Running on oeis4.)