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.

A283614 T(n,k) = number of circular arrays of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.

Table of values

n a(n)
0 1
1 2
2 6
3 4
4 2
5 10
6 24
7 28
8 12
9 2
10 14
11 56
12 132
13 180
14 132
15 40
16 2
17 18
18 100
19 352
20 804
21 1196
22 1120
23 600
24 140
25 2
26 22
27 156
28 728
29 2324
30 5196
31 8160
32 8840
33 6300
34 2660
35 504
36 2
37 26
38 224
39 1300
40 5320
41 15844
42 34872
43 56848
44 67900
45 57820
46 33264
47 11592
48 1848
49 2
50 30
51 304
52 2108
53 10512
54 39064
55 110480
56 240288
57 402556
58 515844
59 496944
60 348600

List of values

[1, 2, 6, 4, 2, 10, 24, 28, 12, 2, 14, 56, 132, 180, 132, 40, 2, 18, 100, 352, 804, 1196, 1120, 600, 140, 2, 22, 156, 728, 2324, 5196, 8160, 8840, 6300, 2660, 504, 2, 26, 224, 1300, 5320, 15844, 34872, 56848, 67900, 57820, 33264, 11592, 1848, 2, 30, 304, 2108, 10512, 39064, 110480, 240288, 402556, 515844, 496944, 348600]