|
|
A074140
|
|
Sum of least integers of prime signatures over all partitions of n.
|
|
9
|
|
|
1, 2, 10, 50, 346, 3182, 38770, 609290, 11226106, 250148582, 7057182250, 216512001950, 7903965900226, 321552174623162, 13779150603234010, 644574260638821590, 33968684108427733426, 1994885097404292104942, 121496572792097514728530, 8114030083731371137603190
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Old name was: Sum of terms in n-th group in A036035.
|
|
LINKS
|
|
|
EXAMPLE
|
a(6) = 64+96+144+216+240+360+900+840+1260+4620+30030 = 38770.
|
|
MAPLE
|
b:= proc(n, i, j) option remember;
`if`(n=0, 1, `if`(i<1, 0, b(n, i-1, j)+
`if`(i>n, 0, ithprime(j)^i*b(n-i, i, j+1))))
end:
a:= n-> b(n$2, 1):
|
|
MATHEMATICA
|
b[n_, i_, j_] := b[n, i, j] = If[n == 0, 1, If[i<1, 0, b[n, i-1, j]+If[i>n, 0, Prime[j]^i*b[n-i, i, j+1]]]]; a[n_] := b[n, n, 1]; Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Feb 25 2014, after Alois P. Heinz *)
|
|
PROG
|
(Sage)
L = []
P = primes_first_n(n)
for p in Partitions(n):
m = mul(P[i]^pi for i, pi in enumerate(p))
L.append(m)
return add(L)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(10)-a(12) from Thomas A. Rockwell (LlewkcoRAT(AT)aol.com), Sep 30 2004
|
|
STATUS
|
approved
|
|
|
|