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.

A240181 Array: t(n,k) is the number of partitions p of n such that the number of distinct numbers in the intersection of p and its conjugate is k, for k >= 0, n >= 1.

Table of values

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

List of values

[0, 1, 2, 2, 0, 1, 2, 3, 2, 4, 1, 4, 6, 0, 1, 4, 8, 3, 8, 8, 5, 1, 10, 9, 11, 10, 22, 8, 1, 1, 14, 22, 17, 3, 18, 34, 19, 5, 1, 18, 50, 21, 12, 26, 60, 34, 13, 2, 30, 74, 52, 19, 0, 1, 36, 105, 57, 29, 4, 44, 120, 93, 34, 5, 1, 60, 144, 128, 40, 13, 64, 186]