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.

A352528 The binary expansion of a(n) is obtained by applying the elementary cellular automaton with rule (2*n) mod 256 to the binary expansion of n.

Table of values

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

List of values

[0, 1, 1, 2, 0, 4, 2, 6, 2, 11, 5, 12, 5, 12, 4, 12, 0, 17, 9, 26, 4, 21, 14, 30, 2, 19, 3, 18, 9, 25, 8, 24, 0, 33, 17, 50, 0, 36, 19, 54, 2, 35, 21, 52, 7, 38, 21, 52, 8, 41, 9, 42, 28, 61, 31, 62, 6, 39, 7, 38, 19, 51, 17, 48, 0, 65, 33, 98, 0, 68, 34, 103]