A335427 a(1) = 0; for k >= 2, a(prime(k)) = 0, a(k^2) = 2 * a(k); otherwise a(n) = a(A334870(n)) + 1.
0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 4, 0, 1, 2, 4, 0, 1, 0, 6, 2, 1, 0, 5, 0, 1, 2, 10, 0, 3, 0, 5, 2, 1, 4, 2, 0, 1, 2, 7, 0, 3, 0, 18, 4, 1, 0, 6, 0, 1, 2, 34, 0, 3, 4, 11, 2, 1, 0, 8, 0, 1, 8, 6, 4, 3, 0, 66, 2, 5, 0, 3, 0, 1, 2, 130, 8, 3, 0, 8, 0, 1, 0, 12, 4, 1, 2, 19, 0, 5, 8, 258, 2, 1, 4, 7, 0, 1, 16, 2, 0, 3, 0, 35, 6
Offset: 1
Keywords
Links
Crossrefs
Related fully additive sequence: A048675.
Programs
-
PARI
A334870(n) = if(issquare(n),sqrtint(n),my(c=core(n), m=n); forprime(p=2, , if(!(c % p), m/=p; break, m*=p)); (m)); A335427(n) = if(n<=2,n-1, if(isprime(n), 0, if(issquare(n), 2*A335427(sqrtint(n)), 1+A335427(A334870(n)))));
-
PARI
A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; }; A052126(n) = if(1==n,n,(n/vecmax(factor(n)[, 1]))); A335427(n) = if(n<=2,n-1, if(issquarefree(n), A048675(A052126(n)), my(k=core(n)); A048675(k) + 2*A335427(sqrtint(n/k))));