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.

A302437 a(n) is the number of ways of writing the binary expansion of n as a concatenation of nonempty substrings with Hamming weight at most 2.

Table of values

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

List of values

[1, 1, 2, 2, 4, 4, 4, 3, 8, 8, 8, 7, 8, 7, 6, 5, 16, 16, 16, 15, 16, 15, 14, 11, 16, 15, 14, 13, 12, 11, 10, 8, 32, 32, 32, 31, 32, 31, 30, 23, 32, 31, 30, 27, 28, 25, 22, 18, 32, 31, 30, 29, 28, 27, 26, 20, 24, 23, 22, 20, 20, 18, 16, 13, 64, 64, 64, 63, 64]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.