A082095 - cp's OEIS frontend

A082095 A 2nd order recursion: a(1)=a(2)=1, a(n) = prime(a(n-2)) + pi(a(n-1)) = A000040(a(n-2)) + A000720(a(n-1)).

n	a(n)
1	1
2	1
3	2
4	3
5	5
6	8
7	15
8	25
9	56
10	113
11	293
12	679
13	2036
14	5389
15	18447
16	54920
17	211347
18	697252
19	2974827
20	10741681
21	50245401
22	196570892
23	998427899
24	4197026430
25	22963115248
26	103007695615
27	603032992418
28	2870053925682
29	17876478098333
30	89829672327175
31	592418610490868
32	3129958832408526
33	21764504060699104
34	120464619408398977
35	880014298908322768
36	5086633622697900677

[1, 1, 2, 3, 5, 8, 15, 25, 56, 113, 293, 679, 2036, 5389, 18447, 54920, 211347, 697252, 2974827, 10741681, 50245401, 196570892, 998427899, 4197026430, 22963115248, 103007695615, 603032992418, 2870053925682, 17876478098333, 89829672327175, 592418610490868, 3129958832408526, 21764504060699104, 120464619408398977, 880014298908322768, 5086633622697900677]

cp's OEIS Frontend

A082095 A 2nd order recursion: a(1)=a(2)=1, a(n) = prime(a(n-2)) + pi(a(n-1)) = A000040(a(n-2)) + A000720(a(n-1)).

Table of values

List of values