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.

A352696 a(n) = k if the binary representation of k has a 1 (0) exactly where a 1 in the n-th row of A237048 occurs at an odd (even) position, reading from left to right.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 2, 1, 5, 2, 2, 3, 2, 2, 11, 1, 2, 6, 2, 3, 10, 2, 2, 3, 5, 2, 10, 3, 2, 13, 2, 1, 10, 2, 11, 6, 2, 2, 10, 3, 2, 13, 2, 2, 45, 2, 2, 3, 5, 5, 10, 2, 2, 13, 10, 3, 10, 2, 2, 14, 2, 2, 43, 1, 10, 13, 2, 2, 10, 11, 2, 7, 2, 2, 44, 2, 11, 12, 2, 3, 21, 2, 2, 14, 10]