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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114918 Number of partitions of {1,..,n} into parts of sizes that are multiples of 2 and 3. 1
 1, 0, 1, 1, 4, 10, 41, 140, 659, 2885, 14956, 77990, 452409, 2678676, 17176251, 113458801, 795016044, 5760341506, 43802563937, 344138100628, 2817486388739, 23809341016525, 208552149482436, 1882541647472398, 17549345518850193 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS FORMULA E.g.f.: exp(SUM{k>0 is a multiple of 2 or 3} (x^k/k!)). CROSSREFS Cf. A000110, A007690. Sequence in context: A355993 A220817 A346889 * A224488 A149213 A149214 Adjacent sequences: A114915 A114916 A114917 * A114919 A114920 A114921 KEYWORD nonn AUTHOR Christian G. Bower, Jan 06 2006 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.

Last modified December 2 20:59 EST 2022. Contains 358510 sequences. (Running on oeis4.)