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.

A336479 For any number n with k binary digits, a(n) is the number of tilings T of a size k staircase polyomino (as described in A335547) such that the sizes of the polyominoes at the base of T correspond to the lengths of runs of consecutive equal digits in the binary representation of n.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 5, 3, 2, 3, 1, 1, 1, 2, 8, 5, 11, 18, 8, 5, 3, 5, 11, 7, 3, 5, 1, 1, 1, 2, 13, 8, 26, 42, 18, 11, 26, 42, 94, 58, 29, 47, 13, 8, 5, 8, 29, 18, 36, 58, 26, 16, 7, 11, 26, 16, 5, 8, 1, 1, 1, 2, 21, 13, 60, 97, 42, 26, 87, 141, 317]