|
|
|
|
1, 2, 2, 3, 6, 6, 3, 6, 6, 4, 10, 10, 12, 30, 30, 12, 30, 30, 4, 10, 10, 12, 30, 30, 12, 30, 30, 5, 14, 14, 15, 42, 42, 15, 42, 42, 20, 70, 70, 60, 210, 210, 60, 210, 210, 20, 70, 70, 60, 210, 210, 60, 210, 210, 5, 14, 14, 15, 42, 42, 15, 42, 42, 20, 70, 70
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Each number k > 0 appears 2^omega(k) times (where omega = A001221).
a(A004488(n)) = a(n) for any n >= 0.
The number of distinct prime factors of a(n) equals the number of nonzero digits in the ternary representation of n.
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
PROG
|
(PARI) a(n) = { my (v=1);
for (o=2, oo,
if (n==0, return (v));
if (gcd(v, o)==1 && omega(o)==1,
if (n % 3, v *= o);
n \= 3;
);
); }
(Python)
from sympy import gcd, primefactors
def omega(n): return 0 if n==1 else len(primefactors(n))
def a(n):
v, o = 1, 2
while True:
if n==0: return v
if gcd(v, o)==1 and omega(o)==1:
if n%3: v*=o
n //= 3
o+=1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|