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.

A303696 Number A(n,k) of binary words of length n with k times as many occurrences of subword 101 as occurrences of subword 010; 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 4
9 7
10 1
11 2
12 4
13 6
14 12
15 1
16 2
17 4
18 6
19 12
20 21
21 1
22 2
23 4
24 6
25 10
26 20
27 37
28 1
29 2
30 4
31 6
32 10
33 17
34 38
35 65
36 1
37 2
38 4
39 6
40 10
41 16
42 28
43 66
44 114
45 1
46 2
47 4
48 6
49 10
50 16
51 26
52 49
53 124
54 200
55 1
56 2
57 4
58 6
59 10
60 16
61 26
62 42
63 84
64 224
65 351
66 1
67 2
68 4
69 6
70 10
71 16
72 26
73 42
74 70
75 148
76 424
77 616

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 4, 7, 1, 2, 4, 6, 12, 1, 2, 4, 6, 12, 21, 1, 2, 4, 6, 10, 20, 37, 1, 2, 4, 6, 10, 17, 38, 65, 1, 2, 4, 6, 10, 16, 28, 66, 114, 1, 2, 4, 6, 10, 16, 26, 49, 124, 200, 1, 2, 4, 6, 10, 16, 26, 42, 84, 224, 351, 1, 2, 4, 6, 10, 16, 26, 42, 70, 148, 424, 616]