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.

A209318 Number T(n,k) of partitions of n with k parts in which no part occurs more than twice; triangle T(n,k), n>=0, 0<=k<=A055086(n), read by rows.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 2, 0, 1, 3, 2, 1, 0, 1, 3, 4, 1, 0, 1, 4, 5, 3, 0, 1, 4, 6, 4, 1, 0, 1, 5, 8, 6, 2, 0, 1, 5, 10, 8, 3, 0, 1, 6, 11, 12, 5, 1, 0, 1, 6, 14, 14, 8, 1, 0, 1, 7, 16, 19, 11, 3, 0, 1, 7, 18, 23, 16, 5]