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.

A182309 Triangle T(n,k) with 2 <= k <= floor(2(n+1)/3) gives the number of length-n binary sequences with exactly k zeros and with length two for the longest run of zeros.

Table of values

n a(n)
2 1
3 2
4 3
5 2
6 4
7 6
8 1
9 5
10 12
11 6
12 6
13 20
14 18
15 3
16 7
17 30
18 40
19 16
20 1
21 8
22 42
23 75
24 50
25 10
26 9
27 56
28 126
29 120
30 45
31 4
32 10
33 72
34 196
35 245
36 140
37 30
38 1
39 11
40 90
41 288
42 448
43 350
44 126
45 15
46 12
47 110
48 405
49 756
50 756
51 392
52 90
53 5
54 13
55 132
56 550
57 1200
58 1470
59 1008
60 357
61 50
62 1
63 14
64 156
65 726

List of values

[1, 2, 3, 2, 4, 6, 1, 5, 12, 6, 6, 20, 18, 3, 7, 30, 40, 16, 1, 8, 42, 75, 50, 10, 9, 56, 126, 120, 45, 4, 10, 72, 196, 245, 140, 30, 1, 11, 90, 288, 448, 350, 126, 15, 12, 110, 405, 756, 756, 392, 90, 5, 13, 132, 550, 1200, 1470, 1008, 357, 50, 1, 14, 156, 726]