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.

A244246 Number of partitions of n into 10 parts such that every i-th smallest part (counted with multiplicity) is different from i.

Original entry on oeis.org

1, 10, 46, 139, 329, 660, 1173, 1918, 2938, 4277, 5990, 8123, 10742, 13903, 17678, 22140, 27383, 33487, 40560, 48710, 58055, 68734, 80881, 94657, 110223, 127771, 147478, 169580, 194278, 221842, 252503, 286579, 324327, 366120, 412247, 463132, 519112, 580667
Offset: 65

Views

Author

Alois P. Heinz, Jun 23 2014

Keywords

Crossrefs

Column k=10 of A238406.