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!)
A292613 a(n) = [x^n] 1/(1-x)^n * Product_{k=1..n} 1/(1-x^k). 5
1, 2, 7, 25, 92, 343, 1292, 4902, 18703, 71677, 275694, 1063636, 4114131, 15948762, 61946290, 241013869, 939125870, 3664299332, 14314777054, 55982787136, 219158088711, 858728875776, 3367576480747, 13216392846128, 51905939548950, 203989227456894, 802164259099114 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Number of ways to pick n units in all partitions of 2n - Olivier Gérard, May 07 2020
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1663 (first 301 terms from Vaclav Kotesovec)
FORMULA
a(n) ~ c * 4^n / sqrt(Pi*n), where c = 1/(2*QPochhammer[1/2, 1/2]) = 1.7313733097275318057689... - Vaclav Kotesovec, Sep 20 2017
a(n) = A292508(n,n+1). - Alois P. Heinz, Jul 16 2021
EXAMPLE
Illustration of comment for n=3, a(3)=25 :
Among the 11 integer partitions of 6, 3 have at least 3 ones.
3,1,1,1 ; 2,1,1,1,1; 1,1,1,1,1,1;
There are respectively 1, 4 and 20 ways to pick 3 of these.
MATHEMATICA
Table[SeriesCoefficient[1/(1-x)^n*Product[1/(1-x^k), {k, 1, n}], {x, 0, n}], {n, 0, 30}]
CROSSREFS
Sequence in context: A024482 A097613 A074605 * A108081 A270785 A199247
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Sep 20 2017
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 March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)