cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A114918 Number of partitions of {1,..,n} into parts of sizes that are multiples of 2 and 3.

Original entry on oeis.org

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
Offset: 0

Views

Author

Christian G. Bower, Jan 06 2006

Keywords

Crossrefs

Formula

E.g.f.: exp(SUM{k>0 is a multiple of 2 or 3} (x^k/k!)).