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.

A073044 Triangle read by rows: T(n,k) (n >= 1, n-1 >= k >= 0) = number of n-sequences of 0's and 1's with no pair of adjacent 0's and exactly k pairs of adjacent 1's.

Table of values

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

List of values

[2, 2, 1, 2, 2, 1, 2, 3, 2, 1, 2, 4, 4, 2, 1, 2, 5, 6, 5, 2, 1, 2, 6, 9, 8, 6, 2, 1, 2, 7, 12, 14, 10, 7, 2, 1, 2, 8, 16, 20, 20, 12, 8, 2, 1, 2, 9, 20, 30, 30, 27, 14, 9, 2, 1, 2, 10, 25, 40, 50, 42, 35, 16, 10, 2, 1, 2, 11, 30, 55, 70, 77, 56, 44, 18, 11, 2, 1, 2, 12, 36, 70, 105, 112, 112, 72]