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.

A119907 Number of partitions of n such that if k is the largest part, then k-2 occurs as a part.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 1
6 3
7 4
8 7
9 9
10 15
11 18
12 27
13 34
14 47
15 58
16 79
17 96
18 127
19 155
20 199
21 242
22 308
23 371
24 465
25 561
26 694
27 833
28 1024
29 1223
30 1491
31 1778
32 2150
33 2556
34 3076
35 3642
36 4359
37 5151
38 6133
39 7225
40 8570
41 10066
42 11892
43 13937
44 16401
45 19173
46 22495
47 26228
48 30676
49 35692
50 41620

List of values

[0, 0, 0, 0, 1, 1, 3, 4, 7, 9, 15, 18, 27, 34, 47, 58, 79, 96, 127, 155, 199, 242, 308, 371, 465, 561, 694, 833, 1024, 1223, 1491, 1778, 2150, 2556, 3076, 3642, 4359, 5151, 6133, 7225, 8570, 10066, 11892, 13937, 16401, 19173, 22495, 26228, 30676, 35692, 41620]