Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.
A083809
Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.
Terms
- a(0) =2a(1) =3a(2) =7a(3) =7a(4) =29a(5) =59a(6) =5a(7) =11a(8) =23a(9) =47a(10) =11a(11) =23a(12) =47a(13) =283a(14) =1699a(15) =7a(16) =29a(17) =59a(18) =709a(19) =2837a(20) =22697a(21) =29a(22) =59a(23) =709a(24) =2837a(25) =22697a(26) =590123a(27) =1180247a(28) =17a(29) =103
External references
- oeis: A083809