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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327552 Number of partitions in all twice partitions of n where the first partition is strict. 4
 0, 1, 2, 7, 11, 29, 63, 125, 225, 489, 930, 1704, 3260, 5859, 10868, 20026, 35062, 61660, 111789, 191119, 337432, 585847, 1003876, 1705380, 2921394, 4930357, 8311554, 14013583, 23435178, 38849655, 64847870, 106784912, 175699558, 289676875, 472418418, 772944773 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..3200 EXAMPLE a(3) = 7 = 1+1+1+2+2 counting the partitions in 3, 21, 111, 2|1, 11|1. MAPLE b:= proc(n, i) option remember; `if`(i*(i+1)/2p+[0, p[1]])(       combinat[numbpart](i)*b(n-i, min(n-i, i-1)))))     end: a:= n-> b(n\$2)[2]: seq(a(n), n=0..36); MATHEMATICA b[n_, i_] := b[n, i] = If[i(i+1)/2

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

Last modified January 21 23:44 EST 2022. Contains 350481 sequences. (Running on oeis4.)