A287051 - cp's OEIS frontend

A287051 a(0) = 0, a(1) = 1; a(2n) = gpf(a(n)), a(2n+1) = a(n) + a(n+1), where gpf(a(n)) is the greatest prime dividing a(n) for a(n) >= 2 and 1 if a(n) = 1 (A006530).

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

[0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 2, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 2, 5, 1, 6, 5, 7, 2, 9, 7, 10, 3, 11, 2, 13, 5, 12, 7, 9, 2, 9, 7, 12, 5, 13, 2, 11, 3, 10, 7, 9, 2, 7, 5, 6, 1, 7, 3, 11, 5, 12, 7, 9, 2, 11, 3, 16, 7, 17, 5, 13, 3, 14, 11, 13, 2, 15, 13, 18, 5, 17, 3, 19, 7, 16, 3, 11, 2, 11, 3, 16, 7]

cp's OEIS Frontend

A287051 a(0) = 0, a(1) = 1; a(2n) = gpf(a(n)), a(2n+1) = a(n) + a(n+1), where gpf(a(n)) is the greatest prime dividing a(n) for a(n) >= 2 and 1 if a(n) = 1 (A006530).

Table of values

List of values

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

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

cp's OEIS Frontend

A287051 a(0) = 0, a(1) = 1; a(2*n) = gpf(a(n)), a(2*n+1) = a(n) + a(n+1), where gpf(a(n)) is the greatest prime dividing a(n) for a(n) >= 2 and 1 if a(n) = 1 (A006530).

Table of values

List of values

A287051 a(0) = 0, a(1) = 1; a(2n) = gpf(a(n)), a(2n+1) = a(n) + a(n+1), where gpf(a(n)) is the greatest prime dividing a(n) for a(n) >= 2 and 1 if a(n) = 1 (A006530).

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