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.

A078805 Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 0.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 0
7 1
8 3
9 1
10 1
11 1
12 4
13 3
14 2
15 0
16 1
17 5
18 6
19 4
20 2
21 1
22 1
23 6
24 10
25 8
26 6
27 2
28 0
29 1
30 7
31 15
32 15
33 13
34 6
35 3
36 1
37 1
38 8
39 21
40 26
41 25
42 16
43 9
44 2
45 0
46 1
47 9
48 28
49 42
50 45
51 36
52 22
53 9
54 4
55 1
56 1
57 10
58 36
59 64
60 77
61 72
62 50
63 28
64 12
65 2
66 0
67 1
68 11
69 45
70 93
71 126
72 133
73 106
74 70
75 34
76 13
77 5
78 1
79 1
80 12
81 55
82 130
83 198
84 232

List of values

[1, 1, 1, 1, 2, 0, 1, 3, 1, 1, 1, 4, 3, 2, 0, 1, 5, 6, 4, 2, 1, 1, 6, 10, 8, 6, 2, 0, 1, 7, 15, 15, 13, 6, 3, 1, 1, 8, 21, 26, 25, 16, 9, 2, 0, 1, 9, 28, 42, 45, 36, 22, 9, 4, 1, 1, 10, 36, 64, 77, 72, 50, 28, 12, 2, 0, 1, 11, 45, 93, 126, 133, 106, 70, 34, 13, 5, 1, 1, 12, 55, 130, 198, 232]