login
a(n) is the number of prime factors, with multiplicity, of abs(A014509(n)).
1

%I #25 Jul 29 2024 22:36:21

%S 0,0,0,0,0,0,0,0,1,4,2,7,7,2,2,4,3,3,7,1,6,4,5,14,4,9,5,10,3,11,2,5,3,

%T 7,11,5,3,4,15,6,5,19,10,6,13,15,5,10,5,5,6,7,5,15,7,5,2,13,4,3,10,5,

%U 9,7,5,4,9,5,4,1,7,4,4,5,3,11,13,10,5,5,7,6

%N a(n) is the number of prime factors, with multiplicity, of abs(A014509(n)).

%H Sean A. Irvine, <a href="/A110841/b110841.txt">Table of n, a(n) for n = 0..91</a>

%F a(n) = A001222(abs(A014509(n))).

%e a(10) = 2 because A014509(10) = 529 = 23^2.

%e a(8) = a(19) = 1 since A014509(8) and A014509(19) are prime.

%o (PARI) a(n) = my(b=bernfrac(2*n), c=floor(abs(b))*sign(b)); if (c==0, 0, bigomega(c)); \\ _Michel Marcus_, Mar 29 2020

%Y Cf. A001222, A073276, A075178, A076547, A076549, A079294, A083687, A084217, A085092, A085737, A089170, A089644, A089655.

%K nonn,less,more

%O 0,10

%A _Jonathan Vos Post_, Sep 16 2005

%E More terms from _Michel Marcus_, Mar 29 2020

%E a(51)-a(65) from _Jinyuan Wang_, Apr 02 2020

%E More terms from _Sean A. Irvine_, Jul 29 2024