A112683 - cp's OEIS frontend

A112683 For each positive integer n, consider the ternary sequence given initially by x(i) = 0 if 1 <= i < n, x(n) = 1; and thereafter determined by the quadratic recurrence x(i) = x(i-1) + x(i-n)^2 mod 3. Define a(n) to be the smallest positive integer N for which x(N+i) = x(i) for all sufficiently large i.

n	a(n)
1	1
2	4
3	4
4	9
5	19
6	4
7	4
8	22
9	36
10	4
11	4
12	45
13	64
14	4
15	4
16	102
17	182
18	213
19	4
20	188
21	272
22	4
23	412
24	225
25	202
26	4
27	4
28	1444
29	512
30	4
31	4
32	840
33	1237
34	4
35	1138
36	362
37	1263
38	4
39	4
40	1536
41	672
42	1786
43	4
44	701
45	741
46	4
47	4
48	2098
49	3921
50	5400
51	178
52	1183
53	2348
54	4
55	7698
56	6042
57	5091
58	4
59	4

[1, 4, 4, 9, 19, 4, 4, 22, 36, 4, 4, 45, 64, 4, 4, 102, 182, 213, 4, 188, 272, 4, 412, 225, 202, 4, 4, 1444, 512, 4, 4, 840, 1237, 4, 1138, 362, 1263, 4, 4, 1536, 672, 1786, 4, 701, 741, 4, 4, 2098, 3921, 5400, 178, 1183, 2348, 4, 7698, 6042, 5091, 4, 4]

cp's OEIS Frontend

Table of values

List of values