This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A035380 Number of partitions of n into parts 6k+1 or 6k+2. 0
 1, 2, 2, 3, 3, 4, 5, 7, 8, 10, 11, 13, 15, 19, 22, 27, 30, 35, 39, 46, 53, 62, 70, 80, 89, 102, 115, 133, 149, 169, 187, 211, 235, 266, 297, 333, 368, 410, 454, 508, 563, 628, 691, 765, 841, 932, 1027, 1136, 1247, 1372, 1502, 1653, 1812, 1993, 2179, 2388 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) ~ exp(Pi*sqrt(2*n)/3) * Gamma(1/6) * Gamma(1/3) / (4 * Pi^(3/2) * sqrt(6*n)). - Vaclav Kotesovec, Aug 27 2015 MATHEMATICA nmax = 100; Rest[CoefficientList[Series[Product[1/((1 - x^(6k+1))*(1 - x^(6k+2))), {k, 0, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Aug 27 2015 *) CROSSREFS Sequence in context: A130083 A117357 A029020 * A036823 A035575 A036816 Adjacent sequences:  A035377 A035378 A035379 * A035381 A035382 A035383 KEYWORD nonn AUTHOR 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.