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.

A028378 Concatenate rows of triangle in A028364 (removing duplicates).

Original entry on oeis.org

0, 1, 2, 3, 5, 7, 9, 14, 19, 23, 28, 42, 56, 66, 76, 90, 132, 174, 202, 227, 255, 297, 429, 561, 645, 715, 785, 869, 1001, 1430, 1859, 2123, 2333, 2529, 2739, 3003, 3432, 4862, 6292, 7150, 7810, 8398, 8986, 9646, 10504, 11934, 16796, 21658
Offset: 0

Views

Author

Keywords

Comments

a(n+1) is the number of subpartitions of the smallest partition of n into distinct parts (minimizing the size of the largest part). The sequence of partitions is [], [1], [2], [2,1], [3,1], [3,2], [3,2,1], [4,2,1], .... - Franklin T. Adams-Watters, Apr 11 2006

Crossrefs