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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 9
6 3
7 7
8 16
9 31
10 5
11 12
12 29
13 57
14 109
15 7
16 19
17 47
18 97
19 189
20 339
21 11
22 30
23 77
24 162
25 323
26 589
27 1043
28 15
29 45
30 118
31 257
32 522
33 975
34 1752
35 2998
36 22
37 67
38 181
39 401
40 831
41 1576
42 2876
43 4987
44 8406
45 30
46 97
47 267
48 608
49 1279
50 2472
51 4571
52 8043
53 13715
54 22652
55 42
56 139
57 392
58 907
59 1941
60 3804
61 7128
62 12693
63 21893
64 36535
65 59521

List of values

[1, 1, 2, 2, 4, 9, 3, 7, 16, 31, 5, 12, 29, 57, 109, 7, 19, 47, 97, 189, 339, 11, 30, 77, 162, 323, 589, 1043, 15, 45, 118, 257, 522, 975, 1752, 2998, 22, 67, 181, 401, 831, 1576, 2876, 4987, 8406, 30, 97, 267, 608, 1279, 2472, 4571, 8043, 13715, 22652, 42, 139, 392, 907, 1941, 3804, 7128, 12693, 21893, 36535, 59521]