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.

A268944 T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod 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 63
15 14
16 7
17 36
18 120
19 220
20 159
21 22
22 8
23 49
24 210
25 565
26 788
27 396
28 30
29 9
30 64
31 336
32 1206
33 2615
34 2780
35 969
36 46
37 10
38 81
39 504
40 2275
41 6834
42 11950
43 9684
44 2349
45 62
46 11
47 100
48 720
49 3928
50 15239
51 38322
52 54045
53 33404
54 5640
55 94
56 12
57 121
58 990

List of values

[2, 3, 4, 4, 9, 6, 5, 16, 24, 10, 6, 25, 60, 63, 14, 7, 36, 120, 220, 159, 22, 8, 49, 210, 565, 788, 396, 30, 9, 64, 336, 1206, 2615, 2780, 969, 46, 10, 81, 504, 2275, 6834, 11950, 9684, 2349, 62, 11, 100, 720, 3928, 15239, 38322, 54045, 33404, 5640, 94, 12, 121, 990]