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.

A200251 T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its previous elements 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 13
16 7
17 21
18 45
19 69
20 48
21 21
22 8
23 28
24 75
25 135
26 181
27 96
28 34
29 9
30 36
31 112
32 267
33 405
34 476
35 192
36 55
37 10
38 45
39 164
40 448
41 951
42 1215
43 1252
44 384
45 89
46 11
47 55
48 225
49 750
50 1792
51 3387
52 3645
53 3292
54 768
55 144
56 12
57 66
58 305
59 1125
60 3434
61 7168
62 12063

List of values

[2, 3, 3, 4, 6, 5, 5, 10, 12, 8, 6, 15, 26, 24, 13, 7, 21, 45, 69, 48, 21, 8, 28, 75, 135, 181, 96, 34, 9, 36, 112, 267, 405, 476, 192, 55, 10, 45, 164, 448, 951, 1215, 1252, 384, 89, 11, 55, 225, 750, 1792, 3387, 3645, 3292, 768, 144, 12, 66, 305, 1125, 3434, 7168, 12063]