STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
reviewed
approved
proposed
reviewed
editing
proposed
return 1 if n==1 else (1 + reduce(mul, [nextprime(i)**f[i] for i in f]))//2
proposed
editing
editing
proposed
print ([a(n) for n in range(1, 101)] ) # Indranil Ghosh, Jun 12 2017
approved
editing
print [a(n) for n in xrangerange(1, 101)] # Indranil Ghosh, Jun 12 2017
proposed
approved
editing
proposed
(Python)
from sympy import factorint, nextprime
from operator import mul
def P(n):
f = factorint(n)
return sorted([f[i] for i in f])
def a046523(n):
x=1
while True:
if P(n) == P(x): return x
else: x+=1
def a048673(n):
f = factorint(n)
return 1 if n==1 else (1 + reduce(mul, [nextprime(i)**f[i] for i in f]))/2
def a(n): return a046523(a048673(n))
print [a(n) for n in xrange(1, 101)] # Indranil Ghosh, Jun 12 2017
approved
editing