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.

A334658 Triangular array read by rows. T(n,k) is the number of length n words on alphabet {0,1} with k maximal runs of 0's having length 2 or more, n>=0, 0<=k<=nearest integer to n/3.

Table of values

n a(n)
0 1
1 2
2 3
3 1
4 5
5 3
6 8
7 8
8 13
9 18
10 1
11 21
12 38
13 5
14 34
15 76
16 18
17 55
18 147
19 53
20 1
21 89
22 277
23 139
24 7
25 144
26 512
27 336
28 32
29 233
30 932
31 766
32 116
33 1
34 377
35 1676
36 1670
37 364
38 9
39 610
40 2984
41 3516
42 1032
43 50
44 987
45 5269
46 7198
47 2714
48 215
49 1
50 1597
51 9239
52 14402
53 6734
54 785
55 11

List of values

[1, 2, 3, 1, 5, 3, 8, 8, 13, 18, 1, 21, 38, 5, 34, 76, 18, 55, 147, 53, 1, 89, 277, 139, 7, 144, 512, 336, 32, 233, 932, 766, 116, 1, 377, 1676, 1670, 364, 9, 610, 2984, 3516, 1032, 50, 987, 5269, 7198, 2714, 215, 1, 1597, 9239, 14402, 6734, 785, 11]