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.

A268193 Triangle read by rows: T(n,k) (n>=1, k>=0) is the number of partitions of n which have k distinct parts i such that i+1 is also a part.

Table of values

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

List of values

[1, 2, 2, 1, 4, 1, 4, 3, 8, 2, 1, 8, 6, 1, 13, 7, 2, 15, 11, 4, 22, 15, 4, 1, 24, 24, 7, 1, 37, 26, 12, 2, 40, 42, 16, 3, 57, 50, 22, 6, 64, 72, 33, 6, 1, 89, 84, 46, 11, 1, 98, 122, 60, 15, 2, 135, 141, 82, 24, 3, 149, 198, 106, 32, 5, 199, 231, 144, 45, 8, 224, 309, 187, 61, 10, 1]