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.

A200668 T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo (k+1).

Table of values

n a(n)
1 2
2 3
3 3
4 4
5 6
6 5
7 5
8 10
9 12
10 8
11 6
12 15
13 26
14 24
15 12
16 7
17 21
18 45
19 69
20 46
21 17
22 8
23 28
24 75
25 135
26 175
27 89
28 25
29 9
30 36
31 112
32 267
33 406
34 432
35 176
36 36
37 10
38 45
39 164
40 448
41 938
42 1217
43 1076
44 350
45 51
46 11
47 55
48 225
49 750
50 1813
51 3283
52 3650
53 2671
54 697
55 72
56 12
57 66
58 305
59 1125
60 3414
61 7322
62 11516
63 10959

List of values

[2, 3, 3, 4, 6, 5, 5, 10, 12, 8, 6, 15, 26, 24, 12, 7, 21, 45, 69, 46, 17, 8, 28, 75, 135, 175, 89, 25, 9, 36, 112, 267, 406, 432, 176, 36, 10, 45, 164, 448, 938, 1217, 1076, 350, 51, 11, 55, 225, 750, 1813, 3283, 3650, 2671, 697, 72, 12, 66, 305, 1125, 3414, 7322, 11516, 10959]