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.

A348369 Number of ways A328596(n) (the reversed binary expansion is an aperiodic necklace) can be expressed as sum A328596(k) + A328596(m) with 0 < k,m < n. The cases A328596(k) + A328596(m) and A328596(m) + A328596(k) are considered equal.

Table of values

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

List of values

[0, 1, 1, 1, 2, 2, 2, 3, 2, 3, 4, 3, 4, 6, 3, 5, 5, 5, 5, 7, 5, 5, 9, 4, 6, 5, 8, 7, 9, 9, 7, 8, 10, 9, 9, 13, 6, 8, 8, 9, 15, 7, 10, 8, 14, 10, 12, 10, 11, 13, 13, 14, 14, 15, 16, 13, 14, 15, 15, 18, 14, 18, 16, 16, 22, 10, 9, 12, 12, 10, 24, 10, 16, 9, 21, 14, 20, 12]