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.

A054242 Triangle read by rows: row n (n>=0) gives the number of partitions of (n,0), (n-1,1), (n-2,2), ..., (0,n) respectively into sums of distinct pairs.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 2
7 3
8 3
9 2
10 2
11 5
12 5
13 5
14 2
15 3
16 7
17 9
18 9
19 7
20 3
21 4
22 10
23 14
24 17
25 14
26 10
27 4
28 5
29 14
30 21
31 27
32 27
33 21
34 14
35 5
36 6
37 19
38 31
39 42
40 46
41 42
42 31
43 19
44 6
45 8
46 25
47 44
48 64
49 74
50 74
51 64
52 44
53 25
54 8
55 10
56 33
57 61
58 93
59 116
60 123
61 116
62 93
63 61
64 33
65 10

List of values

[1, 1, 1, 1, 2, 1, 2, 3, 3, 2, 2, 5, 5, 5, 2, 3, 7, 9, 9, 7, 3, 4, 10, 14, 17, 14, 10, 4, 5, 14, 21, 27, 27, 21, 14, 5, 6, 19, 31, 42, 46, 42, 31, 19, 6, 8, 25, 44, 64, 74, 74, 64, 44, 25, 8, 10, 33, 61, 93, 116, 123, 116, 93, 61, 33, 10]