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.

A239830 Triangular array: T(n,k) = number of partitions of 2n that have alternating sum 2k, with T(0,0) = 1 for convenience.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 1
6 3
7 5
8 2
9 1
10 5
11 9
12 5
13 2
14 1
15 7
16 17
17 10
18 5
19 2
20 1
21 11
22 28
23 20
24 10
25 5
26 2
27 1
28 15
29 47
30 35
31 20
32 10
33 5
34 2
35 1
36 22
37 73
38 62
39 36
40 20
41 10
42 5
43 2
44 1
45 30
46 114
47 102
48 65
49 36
50 20
51 10
52 5
53 2
54 1
55 42
56 170
57 167
58 109
59 65
60 36
61 20
62 10
63 5
64 2
65 1
66 56
67 253
68 262
69 182
70 110

List of values

[1, 1, 1, 2, 2, 1, 3, 5, 2, 1, 5, 9, 5, 2, 1, 7, 17, 10, 5, 2, 1, 11, 28, 20, 10, 5, 2, 1, 15, 47, 35, 20, 10, 5, 2, 1, 22, 73, 62, 36, 20, 10, 5, 2, 1, 30, 114, 102, 65, 36, 20, 10, 5, 2, 1, 42, 170, 167, 109, 65, 36, 20, 10, 5, 2, 1, 56, 253, 262, 182, 110]

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

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