login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A110841
a(n) is the number of prime factors, with multiplicity, of abs(A014509(n)).
1
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, 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, 9, 7, 5, 4, 9, 5, 4, 1, 7, 4, 4, 5, 3, 11, 13, 10, 5, 5, 7, 6
OFFSET
0,10
LINKS
FORMULA
a(n) = A001222(abs(A014509(n))).
EXAMPLE
a(10) = 2 because A014509(10) = 529 = 23^2.
a(8) = a(19) = 1 since A014509(8) and A014509(19) are prime.
PROG
(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
KEYWORD
nonn,less,more
AUTHOR
Jonathan Vos Post, Sep 16 2005
EXTENSIONS
More terms from Michel Marcus, Mar 29 2020
a(51)-a(65) from Jinyuan Wang, Apr 02 2020
More terms from Sean A. Irvine, Jul 29 2024
STATUS
approved