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.

A227736 Irregular table read by rows: the first entry of n-th row is length of run of rightmost identical bits (either 0 or 1, equal to n mod 2), followed by length of the next run of bits, etc., in the binary representation of n, when scanned from the least significant to the most significant end.

Table of values

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

List of values

[1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 3, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 1, 3, 4, 4, 1, 1, 3, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 3, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 2, 3, 1, 1, 3, 1, 4, 5, 5, 1, 1, 4, 1, 1, 1, 3, 1]