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.

A078806 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 1.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 1, 2, 1, 0, 1, 3, 2, 2, 1, 1, 4, 4, 4, 1, 0, 1, 5, 7, 7, 4, 3, 1, 1, 6, 11, 12, 10, 6, 1, 0, 1, 7, 16, 20, 20, 13, 7, 4, 1, 1, 8, 22, 32, 36, 28, 19, 8, 1, 0, 1, 9, 29, 49, 61, 56, 42, 22, 11, 5, 1, 1, 10, 37, 72, 99, 104, 86, 56, 31, 10, 1, 0, 1, 11, 46, 102, 155, 182]