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.

A200469 T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its four 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 13
16 7
17 21
18 45
19 69
20 48
21 20
22 8
23 28
24 75
25 135
26 181
27 98
28 29
29 9
30 36
31 112
32 267
33 405
34 455
35 199
36 43
37 10
38 45
39 164
40 448
41 951
42 1213
43 1120
44 400
45 63
46 11
47 55
48 225
49 750
50 1792
51 3328
52 3627
53 2794
54 800
55 91
56 12
57 66
58 305
59 1125
60 3434
61 7140
62 11576
63 10846

List of values

[2, 3, 3, 4, 6, 5, 5, 10, 12, 8, 6, 15, 26, 24, 13, 7, 21, 45, 69, 48, 20, 8, 28, 75, 135, 181, 98, 29, 9, 36, 112, 267, 405, 455, 199, 43, 10, 45, 164, 448, 951, 1213, 1120, 400, 63, 11, 55, 225, 750, 1792, 3328, 3627, 2794, 800, 91, 12, 66, 305, 1125, 3434, 7140, 11576, 10846]