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.

A327194 For any n >= 0: consider the different ways to split the binary representation of n into two (possibly empty) parts, say with value x and y; a(n) is the least possible value of x^2 + y^2.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 1
5 2
6 5
7 10
8 1
9 2
10 5
11 10
12 9
13 10
14 13
15 18
16 1
17 2
18 5
19 10
20 17
21 26
22 29
23 34
24 9
25 10
26 13
27 18
28 25
29 34
30 45
31 58
32 1
33 2
34 5
35 10
36 17
37 26
38 37
39 50
40 25
41 26
42 29
43 34
44 41
45 50
46 61
47 74
48 9
49 10
50 13
51 18
52 25
53 34
54 45
55 58
56 49
57 50
58 53
59 58
60 65
61 74
62 85
63 98
64 1
65 2
66 5
67 10
68 17
69 26
70 37

List of values

[0, 1, 1, 2, 1, 2, 5, 10, 1, 2, 5, 10, 9, 10, 13, 18, 1, 2, 5, 10, 17, 26, 29, 34, 9, 10, 13, 18, 25, 34, 45, 58, 1, 2, 5, 10, 17, 26, 37, 50, 25, 26, 29, 34, 41, 50, 61, 74, 9, 10, 13, 18, 25, 34, 45, 58, 49, 50, 53, 58, 65, 74, 85, 98, 1, 2, 5, 10, 17, 26, 37]