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.

A210545 T(n,k) = number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least k times.

Table of values

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

List of values

[1, 1, 2, 1, 1, 5, 1, 1, 2, 15, 1, 1, 1, 4, 52, 1, 1, 1, 2, 9, 203, 1, 1, 1, 1, 4, 23, 877, 1, 1, 1, 1, 2, 8, 65, 4140, 1, 1, 1, 1, 1, 4, 17, 199, 21147, 1, 1, 1, 1, 1, 2, 8, 40, 654, 115975, 1, 1, 1, 1, 1, 1, 4, 16, 104, 2296, 678570, 1, 1, 1, 1, 1, 1, 2, 8, 33, 291, 8569, 4213597, 1, 1, 1, 1]