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.

A067150 Number of integers i=1,2,...,n such that (n,i) has Property F3*, i.e., i and n are consecutive terms of a sequence b(k) satisfying b(1)=1, b(n) = (b(n-1) OR 2*b(n-1)) + b(n-2), where the OR is taken bitwise.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 0
7 1
8 1
9 0
10 0
11 0
12 0
13 1
14 0
15 1
16 2
17 1
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 1
26 0
27 1
28 1
29 1
30 0
31 2
32 3
33 0
34 0
35 1
36 0
37 1
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 1
50 0
51 0
52 1
53 1
54 0
55 2
56 1
57 1
58 1
59 0
60 1
61 2
62 0
63 3
64 5
65 0
66 0
67 1
68 0
69 1
70 0
71 1
72 0
73 1
74 0
75 1
76 0
77 1
78 0
79 0
80 0
81 0
82 0
83 0
84 0
85 0
86 0
87 0
88 0
89 0
90 0
91 0
92 0
93 0
94 0
95 0
96 0
97 1
98 0
99 0
100 1
101 0
102 0
103 1
104 1
105 0

List of values

[0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 2, 3, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 2, 1, 1, 1, 0, 1, 2, 0, 3, 5, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0]