A253298 - cp's OEIS frontend

A253298 Digital root for the following sequences, F(4n)/F(4); F(12n)/F(12); F(20*n)/F(20), where the pattern increases by 8, ad infinitum, with the Fibonacci numbers F = A000045.

n	a(n)
1	1
2	7
3	3
4	5
5	5
6	3
7	7
8	1
9	9
10	8
11	2
12	6
13	4
14	4
15	6
16	2
17	8
18	9
19	1
20	7
21	3
22	5
23	5
24	3
25	7
26	1
27	9
28	8
29	2
30	6
31	4
32	4
33	6
34	2
35	8
36	9
37	1
38	7
39	3
40	5
41	5
42	3
43	7
44	1
45	9
46	8
47	2
48	6
49	4
50	4
51	6
52	2
53	8
54	9
55	1
56	7
57	3
58	5
59	5
60	3
61	7
62	1
63	9
64	8
65	2
66	6
67	4
68	4
69	6
70	2
71	8
72	9

[1, 7, 3, 5, 5, 3, 7, 1, 9, 8, 2, 6, 4, 4, 6, 2, 8, 9, 1, 7, 3, 5, 5, 3, 7, 1, 9, 8, 2, 6, 4, 4, 6, 2, 8, 9, 1, 7, 3, 5, 5, 3, 7, 1, 9, 8, 2, 6, 4, 4, 6, 2, 8, 9, 1, 7, 3, 5, 5, 3, 7, 1, 9, 8, 2, 6, 4, 4, 6, 2, 8, 9]

cp's OEIS Frontend

A253298 Digital root for the following sequences, F(4n)/F(4); F(12n)/F(12); F(20*n)/F(20), where the pattern increases by 8, ad infinitum, with the Fibonacci numbers F = A000045.

Table of values

List of values

n	a(n)
1	1
2	7
3	3
4	5
5	5
6	3
7	7
8	1
9	9
10	8
11	2
12	6
13	4
14	4
15	6
16	2
17	8
18	9
19	1
20	7
21	3
22	5
23	5
24	3
25	7
26	1
27	9
28	8
29	2
30	6
31	4
32	4
33	6
34	2
35	8
36	9
37	1
38	7
39	3
40	5
41	5
42	3
43	7
44	1
45	9
46	8
47	2
48	6
49	4
50	4
51	6
52	2
53	8
54	9
55	1
56	7
57	3
58	5
59	5
60	3
61	7
62	1
63	9
64	8
65	2
66	6
67	4
68	4
69	6
70	2
71	8
72	9

n	a(n)
1	1
2	7
3	3
4	5
5	5
6	3
7	7
8	1
9	9
10	8
11	2
12	6
13	4
14	4
15	6
16	2
17	8
18	9
19	1
20	7
21	3
22	5
23	5
24	3
25	7
26	1
27	9
28	8
29	2
30	6
31	4
32	4
33	6
34	2
35	8
36	9
37	1
38	7
39	3
40	5
41	5
42	3
43	7
44	1
45	9
46	8
47	2
48	6
49	4
50	4
51	6
52	2
53	8
54	9
55	1
56	7
57	3
58	5
59	5
60	3
61	7
62	1
63	9
64	8
65	2
66	6
67	4
68	4
69	6
70	2
71	8
72	9

cp's OEIS Frontend

A253298 Digital root for the following sequences, F(4*n)/F(4); F(12*n)/F(12); F(20*n)/F(20), where the pattern increases by 8, ad infinitum, with the Fibonacci numbers F = A000045.

Table of values

List of values

A253298 Digital root for the following sequences, F(4n)/F(4); F(12n)/F(12); F(20*n)/F(20), where the pattern increases by 8, ad infinitum, with the Fibonacci numbers F = A000045.

n	a(n)
1	1
2	7
3	3
4	5
5	5
6	3
7	7
8	1
9	9
10	8
11	2
12	6
13	4
14	4
15	6
16	2
17	8
18	9
19	1
20	7
21	3
22	5
23	5
24	3
25	7
26	1
27	9
28	8
29	2
30	6
31	4
32	4
33	6
34	2
35	8
36	9
37	1
38	7
39	3
40	5
41	5
42	3
43	7
44	1
45	9
46	8
47	2
48	6
49	4
50	4
51	6
52	2
53	8
54	9
55	1
56	7
57	3
58	5
59	5
60	3
61	7
62	1
63	9
64	8
65	2
66	6
67	4
68	4
69	6
70	2
71	8
72	9