|
%I
%S 1,1,1,2,2,2,2,2,2,4,4,2,4,5,2,4,3,3,4,3,3,8,4,2,4,5,3,5,5,5,4,4,2,6,
%T 6,2,7,9,4,6,5,4,6,5,4,12,4,4,6,5,5,7,6,6,7,6,4,10,6,2,7,9,4,6,5,4,6,
%U 7,6,13,7,4,7,7,5,8,5,8,6,4,5,10,8,4,7,11,5,8,9,7,8,6,4,15,5,3,7,10,7,8,7,8
%N Number of prime divisors (counted with multiplicity) of Fibonacci(n)+1.
%C Always greater than 1 for any n >= 4.
%D J. Earls, "Fibonacci," Mathematical Bliss, Pleroma Publications, 2009, pages 60-64. ASIN: B002ACVZ6O
%o (PARI) A168514(n) = bigomega(fibonacci(n)+1) [From _Michael B. Porter_, Mar 02 2010]
%K nonn
%O 1,4
%A Jason Earls (zevi_35711(AT)yahoo.com), Nov 28 2009
|
