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.

A330635 Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 6) with x_i in 0..5, where n >= 0 and 0 <= k <= 5.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 1
7 2
8 0
9 1
10 2
11 0
12 2
13 8
14 8
15 2
16 8
17 8
18 36
19 24
20 48
21 36
22 24
23 48
24 264
25 192
26 192
27 264
28 192
29 192
30 1296
31 1440
32 1152
33 1296
34 1440
35 1152
36 7200
37 8064
38 8064
39 7200
40 8064
41 8064
42 46656
43 44928
44 48384
45 46656
46 44928
47 48384
48 286848
49 276480
50 276480
51 286848
52 276480
53 276480

List of values

[1, 0, 0, 0, 0, 0, 1, 2, 0, 1, 2, 0, 2, 8, 8, 2, 8, 8, 36, 24, 48, 36, 24, 48, 264, 192, 192, 264, 192, 192, 1296, 1440, 1152, 1296, 1440, 1152, 7200, 8064, 8064, 7200, 8064, 8064, 46656, 44928, 48384, 46656, 44928, 48384, 286848, 276480, 276480, 286848, 276480, 276480]