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.

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

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 2
5 2
6 0
7 0
8 4
9 8
10 4
11 0
12 8
13 24
14 24
15 8
16 32
17 64
18 96
19 64
20 192
21 192
22 320
23 320
24 1024
25 768
26 1024
27 1280
28 4608
29 3584
30 3584
31 4608
32 18432
33 16384
34 14336
35 16384
36 69632
37 69632
38 61440
39 61440
40 262144
41 278528
42 262144
43 245760
44 1015808
45 1081344
46 1081344
47 1015808
48 4063232
49 4194304
50 4325376
51 4194304

List of values

[1, 0, 0, 0, 2, 2, 0, 0, 4, 8, 4, 0, 8, 24, 24, 8, 32, 64, 96, 64, 192, 192, 320, 320, 1024, 768, 1024, 1280, 4608, 3584, 3584, 4608, 18432, 16384, 14336, 16384, 69632, 69632, 61440, 61440, 262144, 278528, 262144, 245760, 1015808, 1081344, 1081344, 1015808, 4063232, 4194304, 4325376, 4194304]