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.

A277100 Irregular triangle read by rows: T(n,k) is the number of partitions of n having k distinct parts i (i>=2) of multiplicity i-1 (n>=0).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 4
7 1
8 5
9 2
10 7
11 4
12 10
13 5
14 15
15 6
16 1
17 21
18 8
19 1
20 28
21 13
22 1
23 37
24 18
25 1
26 50
27 25
28 2
29 67
30 31
31 3
32 88
33 42
34 5
35 115
36 55
37 6
38 150
39 73
40 8
41 193
42 93
43 11
44 248
45 122
46 15
47 317
48 154
49 19
50 402
51 200
52 24
53 1
54 508
55 253
56 30
57 1
58 640
59 320
60 41
61 1
62 802
63 399
64 53
65 1
66 1002
67 503
68 69
69 1

List of values

[1, 1, 1, 1, 2, 1, 4, 1, 5, 2, 7, 4, 10, 5, 15, 6, 1, 21, 8, 1, 28, 13, 1, 37, 18, 1, 50, 25, 2, 67, 31, 3, 88, 42, 5, 115, 55, 6, 150, 73, 8, 193, 93, 11, 248, 122, 15, 317, 154, 19, 402, 200, 24, 1, 508, 253, 30, 1, 640, 320, 41, 1, 802, 399, 53, 1, 1002, 503, 69, 1]