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.

A207100 T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two 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 26
15 12
16 7
17 21
18 45
19 68
20 55
21 18
22 8
23 28
24 75
25 140
26 176
27 115
28 27
29 9
30 36
31 112
32 274
33 441
34 458
35 239
36 40
37 10
38 45
39 164
40 462
41 989
42 1382
43 1193
44 498
45 59
46 11
47 55
48 225
49 760
50 1904
51 3579
52 4322
53 3103
54 1038
55 87
56 12
57 66
58 305
59 1158
60 3504
61 7868

List of values

[2, 3, 3, 4, 6, 5, 5, 10, 12, 8, 6, 15, 26, 26, 12, 7, 21, 45, 68, 55, 18, 8, 28, 75, 140, 176, 115, 27, 9, 36, 112, 274, 441, 458, 239, 40, 10, 45, 164, 462, 989, 1382, 1193, 498, 59, 11, 55, 225, 760, 1904, 3579, 4322, 3103, 1038, 87, 12, 66, 305, 1158, 3504, 7868]