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.

A219660 a(n) = number of bit-positions where Fibonacci numbers F(n) and F(n+1) contain both an 1-bit in their binary representation.

Table of values

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

List of values

[0, 1, 0, 1, 1, 0, 1, 2, 0, 2, 2, 1, 1, 4, 2, 3, 4, 3, 1, 4, 3, 1, 5, 4, 3, 3, 5, 7, 8, 4, 4, 3, 4, 8, 5, 4, 6, 6, 4, 7, 7, 10, 7, 11, 7, 8, 8, 4, 8, 12, 8, 9, 7, 8, 10, 13, 8, 8, 10, 8, 6, 12, 11, 12, 13, 10, 8, 7, 10, 13, 9, 9, 14, 12, 11, 9, 11, 13, 13, 13]