A324119 a(n) = A001221(A156552(n)).

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

Offset: 2

Author

Antti Karttunen, Feb 21 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 2..4473
• Index entries for sequences related to binary expansion of n
• Index entries for sequences computed from indices in prime factorization

Crossrefs

Cf. A001221, A156552.

Cf. also A323243, A324104, A324105, A324117 (sigma, phi, tau and number of odd divisors (A001227) similarly permuted).

Cf. also A322812.

Programs

PARI

A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
A156552(n) = if(1==n, 0, if(!(n%2), 1+(2*A156552(n/2)), 2*A156552(A064989(n))));
A324119(n) = if(1==n,0,omega(A156552(n)));