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.

A235130 Triangular array: t(n,k) = number of partitions of n that include a partition of k.

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 8, 6, 7, 7, 11, 11, 11, 11, 11, 10, 11, 15, 15, 17, 15, 14, 13, 15, 15, 22, 22, 23, 23, 21, 22, 19, 20, 22, 30, 30, 33, 30, 33, 25, 29, 25, 29, 30, 42, 42, 45, 44, 43, 41, 42, 36, 36, 39, 42, 56, 56, 62, 58, 60]

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

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