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.

A174806 a(n) = n-floor(sqrt(n))^2-floor(sqrt(n-floor(sqrt(n))^2))^2; difference between n and sum of two largest distinct squares <= n.

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 0, 1, 2, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 0, 0, 1, 2, 0]