The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229863 The number of integer partitions P of n such that either the length k of P is not a part or P has at least one part equal to 1 (or both). 0
 1, 1, 2, 3, 4, 6, 10, 13, 20, 27, 38, 51, 71, 92, 125, 163, 214, 276, 360, 457, 588, 743, 942, 1182, 1487, 1848, 2306, 2852, 3527, 4335, 5331, 6511, 7958, 9675, 11754, 14223, 17198, 20710, 24928, 29901, 35828, 42808, 51099, 60823, 72333, 85811, 101686, 120244, 142036, 167430, 197170, 231761 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA For n>=2; a(n) = A000041(n) - A008483(n-1) G.f.: 1/E(x) - x*(1-x)*(1-x^2)/E(x) + x where E(x) = prod(k>=1, 1-x^k ). EXAMPLE a(10) = 38 because there are 42 unrestricted partitions of 10.  All of these except the following four are counted by this sequence: 8+2,5+3+2,4+3+3,4+2+2+2. MATHEMATICA nn=51; a=Product[1/(1-x^k), {k, 1, nn}]; b= x(Product[1/(1-x^k), {k, 3, nn}]-1); CoefficientList[Series[a-b, {x, 0, nn}], x] PROG (PARI) x='x+O('x^66); Vec( 1/eta(x) - x*(1-x)*(1-x^2)/eta(x) + x ) CROSSREFS Cf. A229816. Sequence in context: A130126 A288338 A121152 * A215255 A200928 A318558 Adjacent sequences:  A229860 A229861 A229862 * A229864 A229865 A229866 KEYWORD nonn AUTHOR Geoffrey Critzer and Joerg Arndt, Oct 01 2013 STATUS approved

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 June 14 07:10 EDT 2021. Contains 345018 sequences. (Running on oeis4.)