A324285 a(n) = A002487(A297168(n)).

0, 0, 0, 1, 0, 2, 0, 2, 1, 3, 0, 3, 0, 4, 2, 3, 0, 4, 0, 5, 3, 5, 0, 4, 1, 6, 2, 7, 0, 5, 0, 4, 4, 7, 2, 7, 0, 8, 5, 7, 0, 7, 0, 9, 3, 9, 0, 5, 1, 5, 6, 11, 0, 8, 3, 10, 7, 10, 0, 9, 0, 11, 5, 5, 4, 13, 0, 13, 8, 6, 0, 10, 0, 12, 4, 15, 2, 19, 0, 9, 3, 13, 0, 11, 5, 14, 9, 13, 0, 11, 3, 17, 10, 15, 6, 6, 0, 6, 7, 9, 0, 25, 0, 16, 5

Offset: 1

Author

Antti Karttunen, Feb 22 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..65537
• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to Stern's sequences

Crossrefs

Cf. A002487, A156552, A297168.

Cf. also A323902, A324115, A324116, A324049.

Programs

PARI

A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A297167(n) = if(1==n, 0, (A061395(n) + (bigomega(n)-omega(n)) - 1));
A297112(n) = if(1==n,0,2^A297167(n));
A297168(n) = sumdiv(n,d,(dA297112(d)); \\ Antti Karttunen, Feb 22 2019
A002487(n) = { my(s=sign(n), a=1, b=0); n = abs(n); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (s*b); };
A324285(n) = A002487(A297168(n));

Formula

a(n) = A002487(A297168(n)).