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.

A056219 Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 5
6 6
7 9
8 13
9 15
10 19
11 25
12 34
13 42
14 51
15 61
16 78
17 98
18 122
19 146
20 175
21 209
22 253
23 307
24 374
25 444
26 524
27 617
28 729
29 858
30 1016
31 1200
32 1414
33 1649
34 1916
35 2223
36 2586
37 2996
38 3475
39 4031
40 4672
41 5385
42 6191
43 7102
44 8148
45 9329
46 10673
47 12201
48 13957
49 15939
50 18172

List of values

[1, 2, 2, 4, 5, 6, 9, 13, 15, 19, 25, 34, 42, 51, 61, 78, 98, 122, 146, 175, 209, 253, 307, 374, 444, 524, 617, 729, 858, 1016, 1200, 1414, 1649, 1916, 2223, 2586, 2996, 3475, 4031, 4672, 5385, 6191, 7102, 8148, 9329, 10673, 12201, 13957, 15939, 18172]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.