A 2nd-order recursion: a(1)=a(2)=1; a(n) = prime(a(n-1)) + primepi(a(n-2)) = A000040(a(n-1)) + A000720(a(n-2)).
A082094
A 2nd-order recursion: a(1)=a(2)=1; a(n) = prime(a(n-1)) + primepi(a(n-2)) = A000040(a(n-1)) + A000720(a(n-2)).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =6a(5) =15a(6) =50a(7) =235a(8) =1498a(9) =12592a(10) =135431a(11) =1806803a(12) =29135476a(13) =555971158a(14) =12336554787a(15) =313733168860
External references
- oeis: A082094