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.

A073097 Let x(n) denote the number of 4's among the n first elements of the continued fraction for sum k>=0 1/2^(2^k) (A007400), y(n) the number of 6's and z(n) the number of 2's. Then a(n)=x(n)-y(n)-z(n)-1.

Table of values

n a(n)
0 -1
1 -1
2 0
3 -1
4 0
5 1
6 0
7 1
8 0
9 1
10 0
11 -1
12 0
13 -1
14 0
15 1
16 0
17 1
18 0
19 -1
20 0
21 1
22 0
23 1
24 0
25 -1
26 0
27 -1
28 0
29 -1
30 0
31 1
32 0
33 1
34 0
35 -1
36 0
37 1
38 0
39 1
40 0
41 1
42 0
43 -1
44 0
45 -1
46 0
47 1
48 0
49 -1
50 0
51 -1
52 0
53 1
54 0
55 1
56 0
57 -1
58 0
59 -1
60 0
61 -1
62 0
63 1
64 0
65 1
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 1
80 0
81 1
82 0
83 -1
84 0
85 1
86 0
87 1
88 0
89 -1
90 0
91 -1
92 0
93 -1
94 0
95 1
96 0
97 -1
98 0
99 -1

List of values

[-1, -1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1]