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.

A330661 T(n,k) is the index within the partitions of n in canonical ordering of the k-th partition whose parts differ pairwise by at most one.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 1, 3, 4, 5, 1, 3, 5, 6, 7, 1, 5, 8, 9, 10, 11, 1, 5, 9, 12, 13, 14, 15, 1, 8, 13, 18, 19, 20, 21, 22, 1, 8, 19, 22, 26, 27, 28, 29, 30, 1, 13, 22, 30, 37, 38, 39, 40, 41, 42, 1, 13, 30, 41, 46, 51, 52, 53, 54, 55, 56, 1, 20, 44, 59, 62, 71, 72, 73, 74, 75, 76, 77]