A216953 - cp's OEIS frontend

A216953 Triangle read by rows: T(n,k) (n>=1, 1<=k<=n) = number of binary sequences of length n with minimal period k.

n	a(n)
1	2
2	2
3	2
4	2
5	0
6	6
7	2
8	2
9	0
10	12
11	2
12	0
13	0
14	0
15	30
16	2
17	2
18	6
19	0
20	0
21	54
22	2
23	0
24	0
25	0
26	0
27	0
28	126
29	2
30	2
31	0
32	12
33	0
34	0
35	0
36	240
37	2
38	0
39	6
40	0
41	0
42	0
43	0
44	0
45	504
46	2
47	2
48	0
49	0
50	30
51	0
52	0
53	0
54	0
55	990
56	2
57	0
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	0
66	2046
67	2
68	2
69	6
70	12
71	0
72	54
73	0
74	0
75	0
76	0
77	0
78	4020
79	2
80	0
81	0
82	0
83	0
84	0
85	0
86	0
87	0
88	0
89	0
90	0
91	8190
92	2
93	2
94	0
95	0
96	0
97	0
98	126
99	0
100	0
101	0
102	0
103	0
104	0
105	16254

[2, 2, 2, 2, 0, 6, 2, 2, 0, 12, 2, 0, 0, 0, 30, 2, 2, 6, 0, 0, 54, 2, 0, 0, 0, 0, 0, 126, 2, 2, 0, 12, 0, 0, 0, 240, 2, 0, 6, 0, 0, 0, 0, 0, 504, 2, 2, 0, 0, 30, 0, 0, 0, 0, 990, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2046, 2, 2, 6, 12, 0, 54, 0, 0, 0, 0, 0, 4020, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8190, 2, 2, 0, 0, 0, 0, 126, 0, 0, 0, 0, 0, 0, 16254]

cp's OEIS Frontend

A216953 Triangle read by rows: T(n,k) (n>=1, 1<=k<=n) = number of binary sequences of length n with minimal period k.

Table of values

List of values