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.

A027300 Triangular array Q given by rows: Q(n,k) = number of partitions of n that do not contain k as an element; domain: 1 <= k <= n, n >= 1.

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 2, 4, 5, 6, 6, 4, 6, 8, 9, 10, 10, 4, 8, 10, 12, 13, 14, 14, 7, 11, 15, 17, 19, 20, 21, 21, 8, 15, 19, 23, 25, 27, 28, 29, 29, 12, 20, 27, 31, 35, 37, 39, 40, 41, 41, 14, 26, 34, 41, 45, 49, 51, 53, 54, 55, 55, 21, 35]