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.

A263850 Let R = Z[(1+sqrt(5))/2] denote the ring of integers in the real quadratic number field of discriminant 5. Then a(n) is the largest integer k such that every totally positive element of norm n in R can be written as a sum of three squares in R in at least k ways, or 0 if there is no totally positive element of norm n.

Table of values

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

List of values

[1, 6, 0, 0, 12, 24, 0, 0, 0, 32, 0, 24, 0, 0, 0, 0, 54, 0, 0, 24, 24, 0, 0, 0, 0, 30, 0, 0, 0, 24, 0, 48, 0, 0, 0, 0, 48, 0, 0, 0, 0, 96, 0, 0, 24, 48, 0, 0, 0, 96, 0, 0, 0, 0, 0, 48, 0, 0, 0, 24, 0, 120, 0, 0, 108, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 72, 0, 0, 48, 120, 54, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0]