a(1)=2; for n>1, a(n+1) = least prime > a(n) and congruent to a prime modulo prime successor of a(n).

A080898

a(1)=2; for n>1, a(n+1) = least prime > a(n) and congruent to a prime modulo prime successor of a(n).

Terms

    a(0) =2a(1) =5a(2) =17a(3) =41a(4) =89a(5) =197a(6) =401a(7) =821a(8) =1657a(9) =3329a(10) =6673a(11) =13381a(12) =13399a(13) =26833a(14) =53681a(15) =107453a(16) =214939a(17) =429889a(18) =429901a(19) =859861a(20) =1719799a(21) =3439663a(22) =6879361a(23) =13758803a(24) =27517687a(25) =55035401a(26) =110070833a(27) =110070889a(28) =220141829a(29) =440283691

External references