OFFSET
1,5
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
PROG
(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of Michel Marcus
A007814(n) = (valuation(n, 2));
(Python)
from sympy import factorint, nextprime, prod
def a007814(n): return 1 + bin(n - 1)[2:].count("1") - bin(n)[2:].count("1")
def a048673(n):
f = factorint(n)
return 1 if n==1 else (1 + prod(nextprime(i)**f[i] for i in f))//2
def a(n): return a007814(a048673(n)) # Indranil Ghosh, Jun 12 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 31 2017
STATUS
approved