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.

A376033 Number A(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; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

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

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 3, 8, 1, 2, 4, 5, 16, 1, 2, 3, 6, 8, 32, 1, 2, 4, 4, 9, 13, 64, 1, 2, 3, 8, 6, 15, 21, 128, 1, 2, 4, 5, 12, 9, 25, 34, 256, 1, 2, 3, 6, 7, 18, 13, 40, 55, 512, 1, 2, 4, 4, 8, 11, 27, 19, 64, 89, 1024, 1, 2, 3, 8, 5, 11, 16, 45, 28, 104, 144, 2048]