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.

A370946 Number of partitions of [n] whose non-singleton elements sum to n.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 2
6 3
7 4
8 5
9 7
10 12
11 14
12 20
13 26
14 36
15 54
16 68
17 90
18 120
19 157
20 202
21 296
22 360
23 480
24 612
25 803
26 1006
27 1317
28 1764
29 2198
30 2821
31 3592
32 4552
33 5754
34 7269
35 9074
36 11990
37 14646
38 18586
39 23112
40 29208
41 35972
42 45277
43 55584
44 69350
45 87881
46 107609
47 133068
48 165038

List of values

[1, 0, 0, 1, 1, 2, 3, 4, 5, 7, 12, 14, 20, 26, 36, 54, 68, 90, 120, 157, 202, 296, 360, 480, 612, 803, 1006, 1317, 1764, 2198, 2821, 3592, 4552, 5754, 7269, 9074, 11990, 14646, 18586, 23112, 29208, 35972, 45277, 55584, 69350, 87881, 107609, 133068, 165038]

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

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