1038006719

Appears in sequences

• 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.at n=44A083809
• a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).at n=8A083810