Smallest subscript j such that d=p[p(j+1)]-p[p(j)]=2n, or 0 if j does not exist (at d=4).
A073132
Smallest subscript j such that d=p[p(j+1)]-p[p(j)]=2n, or 0 if j does not exist (at d=4).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =7a(4) =5a(5) =13a(6) =4a(7) =8a(8) =6a(9) =14a(10) =12a(11) =27a(12) =9a(13) =51a(14) =11a(15) =40a(16) =21a(17) =16a(18) =25a(19) =39a(20) =36a(21) =96a(22) =58a(23) =18a(24) =132a(25) =134a(26) =56a(27) =106a(28) =108a(29) =72
External references
- oeis: A073132