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.

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

Table of values

n a(n)
1 3
2 6
3 5
4 10
5 12
6 8
7 15
8 22
9 22
10 13
11 21
12 35
13 43
14 40
15 21
16 28
17 51
18 71
19 82
20 74
21 34
22 36
23 70
24 106
25 139
26 157
27 136
28 55
29 45
30 92
31 148
32 211
33 271
34 304
35 250
36 89
37 55
38 117
39 197
40 298
41 416
42 531
43 586
44 460
45 144
46 66
47 145
48 253
49 400
50 592
51 821
52 1047
53 1129
54 846
55 233
56 78
57 176
58 316
59 517
60 799

List of values

[3, 6, 5, 10, 12, 8, 15, 22, 22, 13, 21, 35, 43, 40, 21, 28, 51, 71, 82, 74, 34, 36, 70, 106, 139, 157, 136, 55, 45, 92, 148, 211, 271, 304, 250, 89, 55, 117, 197, 298, 416, 531, 586, 460, 144, 66, 145, 253, 400, 592, 821, 1047, 1129, 846, 233, 78, 176, 316, 517, 799]