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.

A242322 T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order.

Table of values

n a(n)
1 7
2 25
3 13
4 65
5 61
6 24
7 140
8 185
9 145
10 44
11 266
12 440
13 503
14 337
15 81
16 462
17 896
18 1300
19 1316
20 781
21 149
22 750
23 1638
24 2801
25 3648
26 3398
27 1829
28 274
29 1155
30 2766
31 5334
32 8231
33 10012
34 8801
35 4269
36 504
37 1705
38 4395
39 9290
40 16194
41 23486
42 27368
43 23069
44 9957
45 927
46 2431
47 6655

List of values

[7, 25, 13, 65, 61, 24, 140, 185, 145, 44, 266, 440, 503, 337, 81, 462, 896, 1300, 1316, 781, 149, 750, 1638, 2801, 3648, 3398, 1829, 274, 1155, 2766, 5334, 8231, 10012, 8801, 4269, 504, 1705, 4395, 9290, 16194, 23486, 27368, 23069, 9957, 927, 2431, 6655]