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.

A376921 Number T(n,k) of binary words of length n avoiding distance (i+1) between "1" digits if the i-th bit is set in the binary representation of k; triangle T(n,k), n>=0, 0<=k<=ceiling(2^(n-1))-1, read by rows.

Table of values

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

List of values

[1, 2, 4, 3, 8, 5, 6, 4, 16, 8, 9, 6, 12, 7, 8, 5, 32, 13, 15, 9, 18, 11, 11, 7, 24, 11, 12, 8, 16, 9, 10, 6, 64, 21, 25, 13, 27, 16, 17, 10, 36, 17, 16, 11, 21, 12, 13, 8, 48, 18, 21, 12, 24, 15, 14, 9, 32, 14, 15, 10, 20, 11, 12, 7]