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.

A221321 T(n,k)=Number of nonnegative integer arrays of length n summing to n without equal adjacent values modulo k.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 0
6 0
7 1
8 2
9 3
10 0
11 1
12 2
13 6
14 8
15 0
16 1
17 2
18 7
19 8
20 5
21 0
22 1
23 2
24 7
25 14
26 19
27 0
28 0
29 1
30 2
31 7
32 14
33 28
34 44
35 28
36 0
37 1
38 2
39 7
40 14
41 30
42 66
43 84
44 72
45 0
46 1
47 2
48 7
49 14
50 30
51 76
52 168
53 212
54 45
55 0
56 1
57 2
58 7
59 14
60 30
61 76
62 185
63 378
64 474
65 0
66 0
67 1
68 2
69 7
70 14
71 30
72 76
73 188
74 430
75 866
76 1008
77 286
78 0
79 1
80 2
81 7
82 14
83 30
84 76

List of values

[1, 1, 0, 1, 0, 0, 1, 2, 3, 0, 1, 2, 6, 8, 0, 1, 2, 7, 8, 5, 0, 1, 2, 7, 14, 19, 0, 0, 1, 2, 7, 14, 28, 44, 28, 0, 1, 2, 7, 14, 30, 66, 84, 72, 0, 1, 2, 7, 14, 30, 76, 168, 212, 45, 0, 1, 2, 7, 14, 30, 76, 185, 378, 474, 0, 0, 1, 2, 7, 14, 30, 76, 188, 430, 866, 1008, 286, 0, 1, 2, 7, 14, 30, 76]