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.

A239904 a(n) = n - wt(n) + (number of times 11 appears in binary expansion of n).

Table of values

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

List of values

[0, 0, 1, 2, 3, 3, 5, 6, 7, 7, 8, 9, 11, 11, 13, 14, 15, 15, 16, 17, 18, 18, 20, 21, 23, 23, 24, 25, 27, 27, 29, 30, 31, 31, 32, 33, 34, 34, 36, 37, 38, 38, 39, 40, 42, 42, 44, 45, 47, 47, 48, 49, 50, 50, 52, 53, 55, 55, 56, 57, 59, 59, 61, 62, 63, 63, 64, 65, 66, 66, 68, 69, 70, 70, 71, 72, 74, 74, 76]

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

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