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.

A250351 T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 2 times.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 9
6 8
7 5
8 16
9 26
10 16
11 6
12 25
13 62
14 75
15 32
16 7
17 36
18 122
19 235
20 216
21 64
22 8
23 49
24 212
25 581
26 888
27 622
28 128
29 9
30 64
31 338
32 1221
33 2724
34 3349
35 1791
36 256
37 10
38 81
39 506
40 2287
41 6900
42 12734
43 12620
44 5157
45 512
46 11
47 100
48 722
49 3935
50 15186
51 38543
52 59406
53 47545
54 14849
55 1024
56 12

List of values

[2, 3, 4, 4, 9, 8, 5, 16, 26, 16, 6, 25, 62, 75, 32, 7, 36, 122, 235, 216, 64, 8, 49, 212, 581, 888, 622, 128, 9, 64, 338, 1221, 2724, 3349, 1791, 256, 10, 81, 506, 2287, 6900, 12734, 12620, 5157, 512, 11, 100, 722, 3935, 15186, 38543, 59406, 47545, 14849, 1024, 12]