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.

A248944 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 1 time.

Table of values

n a(n)
1 2
2 3
3 3
4 4
5 7
6 4
7 5
8 13
9 14
10 5
11 6
12 21
13 36
14 26
15 6
16 7
17 31
18 76
19 90
20 46
21 7
22 8
23 43
24 140
25 246
26 212
27 79
28 8
29 9
30 57
31 234
32 566
33 738
34 478
35 133
36 9
37 10
38 73
39 364
40 1146
41 2104
42 2108
43 1044
44 221
45 10
46 11
47 91
48 536
49 2106
50 5150
51 7364
52 5794
53 2227
54 364
55 11
56 12
57 111
58 756
59 3590
60 11196
61 21652
62 24720

List of values

[2, 3, 3, 4, 7, 4, 5, 13, 14, 5, 6, 21, 36, 26, 6, 7, 31, 76, 90, 46, 7, 8, 43, 140, 246, 212, 79, 8, 9, 57, 234, 566, 738, 478, 133, 9, 10, 73, 364, 1146, 2104, 2108, 1044, 221, 10, 11, 91, 536, 2106, 5150, 7364, 5794, 2227, 364, 11, 12, 111, 756, 3590, 11196, 21652, 24720]