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.

A250361 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 3 times.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 9
6 8
7 5
8 16
9 27
10 16
11 6
12 25
13 64
14 81
15 32
16 7
17 36
18 125
19 255
20 243
21 64
22 8
23 49
24 216
25 623
26 1016
27 729
28 128
29 9
30 64
31 343
32 1293
33 3094
34 4048
35 2187
36 256
37 10
38 81
39 512
40 2397
41 7712
42 15365
43 16128
44 6561
45 512
46 11
47 100
48 729
49 4091
50 16700
51 45866
52 76300
53 64257
54 19683
55 1024
56 12

List of values

[2, 3, 4, 4, 9, 8, 5, 16, 27, 16, 6, 25, 64, 81, 32, 7, 36, 125, 255, 243, 64, 8, 49, 216, 623, 1016, 729, 128, 9, 64, 343, 1293, 3094, 4048, 2187, 256, 10, 81, 512, 2397, 7712, 15365, 16128, 6561, 512, 11, 100, 729, 4091, 16700, 45866, 76300, 64257, 19683, 1024, 12]