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.

A327195 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 abs(x^2 - y^2).

Table of values

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

List of values

[0, 1, 1, 0, 1, 0, 3, 8, 1, 0, 0, 5, 9, 8, 5, 0, 1, 0, 0, 5, 12, 21, 21, 16, 9, 8, 5, 0, 7, 16, 27, 40, 1, 0, 0, 5, 0, 9, 20, 33, 25, 24, 21, 16, 9, 0, 11, 24, 9, 8, 5, 0, 7, 11, 0, 13, 49, 48, 45, 40, 33, 24, 13, 0, 1, 0, 0, 5, 0, 9, 20, 15, 48, 65, 77, 72, 65]