|
1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 1, 4, 1, 2, 2, 5, 1, 4, 1, 6, 3, 3, 1, 7, 2, 2, 3, 4, 1, 8, 1, 7, 2, 3, 2, 9, 1, 2, 3, 12, 1, 7, 1, 6, 4, 3, 1, 12, 2, 6, 2, 4, 1, 7, 3, 7, 3, 2, 1, 19, 1, 3, 6, 11, 2, 8, 1, 6, 2, 7, 1, 16, 1, 2, 4, 4, 2, 7, 1, 21, 5, 3, 1, 16, 3, 2, 3, 12, 1, 18, 3, 6, 2, 3, 2, 19, 1, 4, 4, 16, 1, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Number of factorizations of the square of n into terms of A329609 that are larger than one.
|
|
LINKS
|
|
|
FORMULA
|
a(p) = 1 for all primes p.
|
|
PROG
|
(PARI)
A156552(n) = { my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res };
A353303(n, m=n) = if(1==n, 1, my(s=0); fordiv(n, d, if((d>1)&&(d<=m)&&
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|