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.

A183884 T(n,k)=Number of arrangements of n+2 numbers in 0..k with each number being the sum mod (k+1) of two others.

Table of values

n a(n)
1 4
2 1
3 11
4 4
5 31
6 26
7 1
8 35
9 171
10 57
11 4
12 25
13 446
14 631
15 120
16 1
17 89
18 821
19 2827
20 2059
21 247
22 4
23 1
24 1566
25 8361
26 13686
27 6399
28 502
29 1
30 35
31 1231
32 20527
33 57625
34 59859
35 19483
36 1013
37 4
38 31
39 1986
40 32521
41 183310
42 336617
43 250198
44 58807
45 2036
46 1
47 35
48 1761
49 52827
50 424537

List of values

[4, 1, 11, 4, 31, 26, 1, 35, 171, 57, 4, 25, 446, 631, 120, 1, 89, 821, 2827, 2059, 247, 4, 1, 1566, 8361, 13686, 6399, 502, 1, 35, 1231, 20527, 57625, 59859, 19483, 1013, 4, 31, 1986, 32521, 183310, 336617, 250198, 58807, 2036, 1, 35, 1761, 52827, 424537]