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.

A277193 Number of integers k in range [n^2, ((n+1)^2)-1] for which 3 = the least number of squares that add up to k (A002828).

Table of values

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

List of values

[0, 1, 1, 3, 4, 4, 6, 6, 8, 9, 9, 12, 11, 14, 15, 14, 17, 18, 19, 19, 23, 20, 24, 25, 25, 26, 29, 29, 30, 32, 32, 32, 36, 36, 37, 39, 41, 40, 42, 43, 45, 45, 47, 46, 50, 49, 50, 54, 52, 55, 56, 57, 60, 60, 63, 60, 62, 65, 68, 64, 67, 70, 72, 69, 73, 74, 75, 76, 78, 78, 80, 84, 79, 85, 84, 84, 88, 89, 90, 90, 91, 94, 94, 97, 94, 99]