**Euler's table: triangular array T read by rows, where T(n,k) = number of partitions in which every part is <=k for 1<=k<=n. Also number of partitions of n into at most k parts.**

*1, 1, 2, 1, 2, 3, 1, 3, 4, 5, 1, 3, 5, 6, 7, 1, 4, 7, 9, 10, 11, 1, 4, 8, 11, 13, 14, 15, 1, 5, 10*

*1 seqfan posts*

Index of A-numbers in seqfan: by ascending order by month by frequency by keyword

Links to OEIS content are included according to The OEIS End-User License Agreement .