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.

A269776 T(n,k)=Number of length-n 0..k arrays with every 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 8
7 5
8 16
9 27
10 14
11 6
12 25
13 64
14 78
15 24
16 7
17 36
18 125
19 252
20 222
21 40
22 8
23 49
24 216
25 620
26 984
27 624
28 66
29 9
30 64
31 343
32 1290
33 3060
34 3816
35 1740
36 108
37 10
38 81
39 512
40 2394
41 7680
42 15040
43 14724
44 4824
45 176
46 11
47 100
48 729
49 4088
50 16674
51 45600
52 73680
53 56592
54 13320
55 286
56 12
57 121

List of values

[2, 3, 4, 4, 9, 8, 5, 16, 27, 14, 6, 25, 64, 78, 24, 7, 36, 125, 252, 222, 40, 8, 49, 216, 620, 984, 624, 66, 9, 64, 343, 1290, 3060, 3816, 1740, 108, 10, 81, 512, 2394, 7680, 15040, 14724, 4824, 176, 11, 100, 729, 4088, 16674, 45600, 73680, 56592, 13320, 286, 12, 121]