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.

A269678 T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo k+1.

Table of values

n a(n)
1 2
2 3
3 4
4 4
5 9
6 6
7 5
8 16
9 24
10 10
11 6
12 25
13 60
14 66
15 14
16 7
17 36
18 120
19 224
20 174
21 22
22 8
23 49
24 210
25 570
26 820
27 462
28 30
29 9
30 64
31 336
32 1212
33 2670
34 2976
35 1206
36 46
37 10
38 81
39 504
40 2282
41 6918
42 12390
43 10700
44 3150
45 62
46 11
47 100
48 720
49 3936
50 15358
51 39156
52 57030
53 38224
54 8166
55 94
56 12
57 121

List of values

[2, 3, 4, 4, 9, 6, 5, 16, 24, 10, 6, 25, 60, 66, 14, 7, 36, 120, 224, 174, 22, 8, 49, 210, 570, 820, 462, 30, 9, 64, 336, 1212, 2670, 2976, 1206, 46, 10, 81, 504, 2282, 6918, 12390, 10700, 3150, 62, 11, 100, 720, 3936, 15358, 39156, 57030, 38224, 8166, 94, 12, 121]