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.

A360683 Number of integer partitions of n whose second differences sum to 0, meaning either there is only one part, or the first two parts have the same difference as the last two parts.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 4
6 8
7 6
8 11
9 12
10 17
11 14
12 32
13 23
14 40
15 44
16 64
17 59
18 104
19 93
20 149
21 157
22 218
23 227
24 342
25 349
26 481
27 538
28 713
29 777
30 1052
31 1145
32 1494
33 1692
34 2130
35 2416
36 3064
37 3449
38 4286
39 4918
40 6028
41 6882
42 8424
43 9620
44 11634
45 13396
46 16022
47 18416
48 22019
49 25248
50 29954

List of values

[1, 1, 2, 3, 4, 4, 8, 6, 11, 12, 17, 14, 32, 23, 40, 44, 64, 59, 104, 93, 149, 157, 218, 227, 342, 349, 481, 538, 713, 777, 1052, 1145, 1494, 1692, 2130, 2416, 3064, 3449, 4286, 4918, 6028, 6882, 8424, 9620, 11634, 13396, 16022, 18416, 22019, 25248, 29954]