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.

A269175 a(n) = number of distinct k for which A269174(k) = n; number of finite predecessors for pattern encoded in the binary expansion of n in Wolfram's Rule 124 cellular automaton.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 2, 1, 0, 2, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 2, 0, 0, 2, 1, 1]