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.

A119462 Triangle read by rows: T(n,k) is the number of circular binary words of length n having k occurrences of 01 (0 <= k <= floor(n/2)).

Table of values

n a(n)
0 1
1 2
2 2
3 2
4 2
5 6
6 2
7 12
8 2
9 2
10 20
11 10
12 2
13 30
14 30
15 2
16 2
17 42
18 70
19 14
20 2
21 56
22 140
23 56
24 2
25 2
26 72
27 252
28 168
29 18
30 2
31 90
32 420
33 420
34 90
35 2
36 2
37 110
38 660
39 924
40 330
41 22
42 2
43 132
44 990
45 1848
46 990
47 132
48 2
49 2
50 156
51 1430
52 3432
53 2574
54 572
55 26
56 2
57 182
58 2002
59 6006
60 6006
61 2002
62 182
63 2
64 2
65 210
66 2730
67 10010
68 12870
69 6006
70 910
71 30

List of values

[1, 2, 2, 2, 2, 6, 2, 12, 2, 2, 20, 10, 2, 30, 30, 2, 2, 42, 70, 14, 2, 56, 140, 56, 2, 2, 72, 252, 168, 18, 2, 90, 420, 420, 90, 2, 2, 110, 660, 924, 330, 22, 2, 132, 990, 1848, 990, 132, 2, 2, 156, 1430, 3432, 2574, 572, 26, 2, 182, 2002, 6006, 6006, 2002, 182, 2, 2, 210, 2730, 10010, 12870, 6006, 910, 30]