login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143229 a(n) = A000041(n) * A000070(n). 3
1, 2, 8, 21, 60, 133, 330, 675, 1474, 2910, 5838, 10920, 20944, 37673, 68580, 120384, 211365, 359964, 614845, 1022630, 1701678, 2776752, 4517016, 7232565, 11557350, 18201568, 28579152, 44373420, 68634280, 105109125, 160436916, 242692582, 365853180, 547346709 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Row sums of triangle A143228.
LINKS
FORMULA
a(n) = A000041(n) * A000070(n).
a(n) ~ exp(2*sqrt(2*n/3)*Pi)/(8*sqrt(6)*Pi*n^(3/2)) * (1 + (5*Pi/(12*sqrt(6)) - sqrt(3/2)/Pi)/sqrt(n) + (13*Pi^2/1728 - 19/48)/n). - Vaclav Kotesovec, Nov 04 2016
EXAMPLE
a(4) = 60 = A000041(4) * A000070(4) = 5 * 12.
a(4) = 60 = sum of row 4 terms of row 4 in triangle A143228: (5 + 5 + 10 + 15 + 25).
MATHEMATICA
A143229[n_]:= PartitionsP[n]*Sum[PartitionsP[k], {k, 0, n}];
Table[A143229[n], {n, 0, 50}] (* G. C. Greubel, Aug 27 2024 *)
PROG
(Magma)
A143229:= func< n | NumberOfPartitions(n)*(&+[NumberOfPartitions(k): k in [0..n]]) >;
[A143229(n): n in [0..50]]; // G. C. Greubel, Aug 27 2024
(SageMath)
def p(n): return number_of_partitions(n) # A000041
def A143229(n): return p(n)*sum(p(k) for k in range(n+1))
[A143229(n) for n in range(51)] # G. C. Greubel, Aug 27 2024
CROSSREFS
Sequence in context: A216893 A264245 A123044 * A123285 A143212 A316270
KEYWORD
nonn,changed
AUTHOR
Gary W. Adamson, Jul 31 2008
EXTENSIONS
More terms from Vaclav Kotesovec, Nov 04 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 9 20:03 EDT 2024. Contains 375765 sequences. (Running on oeis4.)