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.

A211700 T(n,k)=Number of nonnegative integer arrays of length n+2k-2 with new values introduced in order 0 upwards and every value appearing only in runs of at least k.

Table of values

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

List of values

[1, 1, 2, 1, 2, 5, 1, 2, 3, 15, 1, 2, 3, 6, 52, 1, 2, 3, 4, 11, 203, 1, 2, 3, 4, 7, 23, 877, 1, 2, 3, 4, 5, 12, 47, 4140, 1, 2, 3, 4, 5, 8, 19, 103, 21147, 1, 2, 3, 4, 5, 6, 13, 33, 226, 115975, 1, 2, 3, 4, 5, 6, 9, 20, 59, 518, 678570, 1, 2, 3, 4, 5, 6, 7, 14, 29, 102, 1200, 4213597, 1, 2, 3, 4]