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.

A264052 Triangle read by rows: T(n,k) (n>=0, 0<=k<=A259361(n)) is the number of integer partitions of n having k distinct parts occurring at least twice.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 2, 3, 3, 4, 4, 6, 1, 5, 9, 1, 6, 13, 3, 8, 18, 4, 10, 23, 9, 12, 32, 12, 15, 42, 19, 1, 18, 55, 27, 1, 22, 69, 41, 3, 27, 89, 56, 4, 32, 112, 78, 9, 38, 141, 106, 12, 46, 175, 141, 23, 54, 217, 188, 31, 64, 266, 247, 49, 1, 76, 326, 321, 68, 1]