a(1) = 2; for n>1, a(n) = smallest number == 1 (mod a(n-1)) with a prime signature of n.

A087311

a(1) = 2; for n>1, a(n) = smallest number == 1 (mod a(n-1)) with a prime signature of n.

Terms

    a(0) =2a(1) =3a(2) =7a(3) =169a(4) =677a(5) =1355a(6) =2711

External references