|
|
A131802
|
|
Sequence related to factorizations and prime signatures: a(1) = 1; for n>1, a(n) = A057567(n) - 2*A001055(n).
|
|
4
|
|
|
1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 3, 0, 1, 1, 2, 0, 3, 0, 3, 1, 1, 0, 7, 0, 1, 1, 3, 0, 5, 0, 5, 1, 1, 1, 8, 0, 1, 1, 7, 0, 5, 0, 3, 3, 1, 0, 14, 0, 3, 1, 3, 0, 7, 1, 7, 1, 1, 0, 14, 0, 1, 3, 8, 1, 5, 0, 3, 1, 5, 0, 20, 0, 1, 3, 3, 1, 5, 0, 14, 2, 1, 0, 14, 1, 1, 1, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
PROG
|
(PARI)
fcnt(n, m) = {local(s); s=0; if(n == 1, s=1, fordiv(n, d, if(d > 1 & d <= m, s=s+fcnt(n/d, d)))); s}
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|