A160348 - cp's OEIS frontend

A160348 Minimal recursive sequence such that if a(n) > 0 then always a(n) > a((f(2n+1)-1)/2), where f is defined by f(2n+1) = (3n+2)/A006519(3n+2) for n>=1, that is f(m) = A075677(2*m-1) for odd m.

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

[0, 2, 1, 6, 7, 5, 3, 11, 4, 13, 14, 10, 15, 52, 12, 50, 53, 9, 54, 59, 51, 62, 63, 49, 60, 65, 8, 68, 69, 58, 16, 75, 61, 56, 76, 48, 77, 80, 64, 84, 85, 67, 78, 88, 57, 44]

cp's OEIS Frontend

A160348 Minimal recursive sequence such that if a(n) > 0 then always a(n) > a((f(2n+1)-1)/2), where f is defined by f(2n+1) = (3n+2)/A006519(3n+2) for n>=1, that is f(m) = A075677(2*m-1) for odd m.

Table of values

List of values

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

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

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