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.

A242618 Number T(n,k) of partitions of n, where k is the difference between the number of odd parts and the number of even parts, both counted without multiplicity; triangle T(n,k), n>=0, read by rows.

Table of values

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

List of values

[1, 1, 1, 0, 1, 1, 2, 2, 1, 1, 1, 4, 2, 1, 1, 2, 3, 3, 2, 1, 8, 3, 3, 2, 4, 6, 5, 5, 4, 13, 8, 4, 1, 5, 5, 11, 13, 7, 1, 11, 20, 14, 9, 2, 1, 6, 13, 17, 26, 11, 3, 1, 22, 31, 27, 15, 5, 2, 12, 18, 34, 44, 18, 7, 4, 40, 47, 51, 23, 11, 5, 16, 36, 56, 72, 34, 11, 1]