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.

A078802 Triangular array T given by T(n,k) = number of 01-words of length n containing k 1's, no three of which are consecutive.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 0, 1, 4, 6, 2, 0, 1, 5, 10, 7, 1, 0, 1, 6, 15, 16, 6, 0, 0, 1, 7, 21, 30, 19, 3, 0, 0, 1, 8, 28, 50, 45, 16, 1, 0, 0, 1, 9, 36, 77, 90, 51, 10, 0, 0, 0, 1, 10, 45, 112, 161, 126, 45, 4, 0, 0, 0, 1, 11, 55, 156, 266, 266, 141, 30, 1, 0, 0, 0, 1, 12, 66, 210, 414]