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.

A226062 a(n) = Bulgarian solitaire operation applied to the partition encoded in the runlengths of binary expansion of n.

Table of values

n a(n)
0 0
1 1
2 3
3 2
4 13
5 7
6 6
7 6
8 11
9 29
10 15
11 58
12 9
13 14
14 4
15 14
16 19
17 27
18 61
19 54
20 245
21 31
22 122
23 52
24 27
25 25
26 30
27 50
28 25
29 12
30 12
31 30
32 35
33 23
34 59
35 46
36 237
37 125
38 118
39 44
40 235
41 501
42 63
43 1002
44 233
45 250
46 116
47 40
48 51
49 19
50 57
51 38
52 229
53 62
54 114
55 36
56 59
57 17
58 28
59 34
60 57
61 8
62 28
63 62

List of values

[0, 1, 3, 2, 13, 7, 6, 6, 11, 29, 15, 58, 9, 14, 4, 14, 19, 27, 61, 54, 245, 31, 122, 52, 27, 25, 30, 50, 25, 12, 12, 30, 35, 23, 59, 46, 237, 125, 118, 44, 235, 501, 63, 1002, 233, 250, 116, 40, 51, 19, 57, 38, 229, 62, 114, 36, 59, 17, 28, 34, 57, 8, 28, 62]