|
Search: id:A047968
|
|
|
| A047968 |
|
a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d. |
|
+0
7
|
|
| 1, 3, 4, 8, 8, 17, 16, 30, 34, 52, 57, 99, 102, 153, 187, 261, 298, 432, 491, 684, 811, 1061, 1256, 1696, 1966, 2540, 3044, 3876, 4566, 5846, 6843, 8610, 10203, 12610, 14906, 18491, 21638, 26508, 31290, 38044, 44584, 54133, 63262, 76241
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Row sums of triangle A137587. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 27 2008
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
N. J. A. Sloane, Transforms
|
|
FORMULA
|
G.f.: Sum_{k>0} (-1+1/Product_{i>0} (1-z^(k*i))). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 22 2003
|
|
MAPLE
|
with(combinat): with(numtheory): a := proc(n) c := 0: l := sort(convert(divisors(n), list)): for i from 1 to nops(l) do c := c+numbpart(l[i]) od: RETURN(c): end: for j from 1 to 60 do printf(`%d, `, a(j)) od: - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 14 2007
|
|
CROSSREFS
|
Cf. A000041, A047966.
Inverse Moebius transform of A000041. Cf. A000837, A047966, A055893.
Cf. A137587.
Sequence in context: A065309 A097689 A030014 this_sequence A125219 A075562 A089290
Adjacent sequences: A047965 A047966 A047967 this_sequence A047969 A047970 A047971
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
