|
|
A364360
|
|
a(n) = dpf(n) ^ tpf(n), where dpf(n) is the number of distinct prime factors of n if n >= 2 and otherwise = 0; tpf(n) is the number of all prime factors of n if n >= 2 and otherwise = 0.
|
|
1
|
|
|
1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 8, 1, 4, 4, 1, 1, 8, 1, 8, 4, 4, 1, 16, 1, 4, 1, 8, 1, 27, 1, 1, 4, 4, 4, 16, 1, 4, 4, 16, 1, 27, 1, 8, 8, 4, 1, 32, 1, 8, 4, 8, 1, 16, 4, 16, 4, 4, 1, 81, 1, 4, 8, 1, 4, 27, 1, 8, 4, 27, 1, 32, 1, 4, 8, 8, 4, 27, 1, 32, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
LINKS
|
|
|
FORMULA
|
For n >= 2:
a(n) = 1 => a(n) in A246655, prime powers.
|
|
MAPLE
|
with(numtheory):
dpf := n -> ifelse(n = 0, 0, nops(factorset(n))): # dpf = [0] U [A001221].
tpf := n -> ifelse(n = 0, 0, bigomega(n)): # tpf = [0] U [A001222].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|