A339895 a(n) = A339894(n) - A061395(n).

0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 1, 2, 0, 0, 1, 1, 0, 1, 0, 1, 2, 0, 0, 2, 2, 2, 1, 1, 0, 3, 1, 1, 1, 0, 0, 2, 0, 0, 2, 2, 1, 1, 0, 1, 1, 2, 0, 3, 0, 0, 3, 1, 2, 1, 0, 2, 3, 0, 0, 2, 1, 0, 1, 1, 0, 3, 2, 1, 1, 0, 1, 2, 0, 3, 2, 2, 0, 1, 0, 1, 3

Offset: 1

Author

Antti Karttunen, Dec 21 2020

Keywords

• nonn

Links

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

Crossrefs

Cf. A000523, A061395, A122111, A334201, A339893, A339894, A339896.

Cf. A339897 (first occurrence of each n).

Programs

PARI

A000523(n) = if( n<1, 0, #binary(n) - 1); \\ From A000523
A122111(n) = if(1==n,n,my(f=factor(n), es=Vecrev(f[,2]),is=concat(apply(primepi,Vecrev(f[,1])),[0]),pri=0,m=1); for(i=1, #es, pri += es[i]; m *= prime(pri)^(is[i]-is[1+i])); (m));
A339894(n) = A000523(A122111(n));
A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1])));
A339895(n) = (A339894(n)-A061395(n));

Formula

a(n) = A339894(n) - A061395(n).

a(n) = A334201(n) - A339896(n).

a(n) = A339893(A122111(n)).