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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 2
7 0
8 0
9 2
10 9
11 4
12 4
13 4
14 4
15 25
16 30
17 20
18 20
19 30
20 145
21 120
22 120
23 120
24 120
25 625
26 650
27 600
28 600
29 650
30 3225
31 3100
32 3100
33 3100
34 3100
35 15625
36 15750
37 15500
38 15500
39 15750
40 78625
41 78000
42 78000
43 78000
44 78000
45 390625
46 391250
47 390000
48 390000
49 391250
50 1955625
51 1952500
52 1952500
53 1952500
54 1952500

List of values

[1, 0, 0, 0, 0, 1, 2, 0, 0, 2, 9, 4, 4, 4, 4, 25, 30, 20, 20, 30, 145, 120, 120, 120, 120, 625, 650, 600, 600, 650, 3225, 3100, 3100, 3100, 3100, 15625, 15750, 15500, 15500, 15750, 78625, 78000, 78000, 78000, 78000, 390625, 391250, 390000, 390000, 391250, 1955625, 1952500, 1952500, 1952500, 1952500]