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.

A201377 Triangle read by rows: T(n,k) (0 <= k <= n) is the number of partitions of (n,k) into a sum of distinct pairs.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 3
5 5
6 2
7 5
8 9
9 17
10 2
11 7
12 14
13 27
14 46
15 3
16 10
17 21
18 42
19 74
20 123
21 4
22 14
23 31
24 64
25 116
26 197
27 323
28 5
29 19
30 44
31 93
32 174
33 303
34 506
35 809
36 6
37 25
38 61
39 132
40 254
41 452
42 769
43 1251
44 1966
45 8
46 33
47 83
48 185
49 363
50 659
51 1141
52 1885
53 3006
54 4660

List of values

[1, 1, 2, 1, 3, 5, 2, 5, 9, 17, 2, 7, 14, 27, 46, 3, 10, 21, 42, 74, 123, 4, 14, 31, 64, 116, 197, 323, 5, 19, 44, 93, 174, 303, 506, 809, 6, 25, 61, 132, 254, 452, 769, 1251, 1966, 8, 33, 83, 185, 363, 659, 1141, 1885, 3006, 4660]