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.

A183904 T(n,k) = Number of nondecreasing arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others.

Table of values

n a(n)
1 3
2 1
3 4
4 5
5 7
6 5
7 1
8 14
9 17
10 6
11 3
12 5
13 38
14 25
15 7
16 1
17 24
18 66
19 70
20 34
21 8
22 5
23 1
24 130
25 174
26 111
27 44
28 9
29 1
30 22
31 136
32 364
33 329
34 162
35 55
36 10
37 3
38 9
39 243
40 664
41 771
42 539
43 224
44 67
45 11
46 1
47 12
48 242
49 1160
50 1720
51 1386
52 815
53 298
54 80
55 12
56 5
57 3
58 385
59 1866
60 3347
61 3491
62 2281
63 1169
64 385
65 94
66 13
67 1
68 50

List of values

[3, 1, 4, 5, 7, 5, 1, 14, 17, 6, 3, 5, 38, 25, 7, 1, 24, 66, 70, 34, 8, 5, 1, 130, 174, 111, 44, 9, 1, 22, 136, 364, 329, 162, 55, 10, 3, 9, 243, 664, 771, 539, 224, 67, 11, 1, 12, 242, 1160, 1720, 1386, 815, 298, 80, 12, 5, 3, 385, 1866, 3347, 3491, 2281, 1169, 385, 94, 13, 1, 50]