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.

A239829 Triangular array: T(n,k) = number of partitions of 2n - 1 that have alternating sum 2k - 1.

Table of values

n a(n)
1 1
2 2
3 1
4 4
5 2
6 1
7 7
8 5
9 2
10 1
11 12
12 10
13 5
14 2
15 1
16 19
17 19
18 10
19 5
20 2
21 1
22 30
23 33
24 20
25 10
26 5
27 2
28 1
29 45
30 57
31 36
32 20
33 10
34 5
35 2
36 1
37 67
38 92
39 64
40 36
41 20
42 10
43 5
44 2
45 1
46 97
47 147
48 107
49 65
50 36
51 20
52 10
53 5
54 2
55 1
56 139
57 227
58 177
59 110
60 65
61 36
62 20
63 10
64 5
65 2
66 1
67 195
68 345
69 282
70 184

List of values

[1, 2, 1, 4, 2, 1, 7, 5, 2, 1, 12, 10, 5, 2, 1, 19, 19, 10, 5, 2, 1, 30, 33, 20, 10, 5, 2, 1, 45, 57, 36, 20, 10, 5, 2, 1, 67, 92, 64, 36, 20, 10, 5, 2, 1, 97, 147, 107, 65, 36, 20, 10, 5, 2, 1, 139, 227, 177, 110, 65, 36, 20, 10, 5, 2, 1, 195, 345, 282, 184]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.