a(n) is the smallest Fermat pseudoprime to base 2 such that gpf(p-1) = prime(n) for all prime factors p of a(n).

A327789

a(n) is the smallest Fermat pseudoprime to base 2 such that gpf(p-1) = prime(n) for all prime factors p of a(n).

Terms

    a(0) =4369a(1) =1387a(2) =341a(3) =3277a(4) =2047a(5) =8321a(6) =31621a(7) =104653a(8) =280601a(9) =13747a(10) =2081713a(11) =88357a(12) =8902741a(13) =741751a(14) =665333a(15) =680627a(16) =2008597a(17) =1252697a(18) =3235699a(19) =1293337a(20) =513629a(21) =8095447a(22) =83333a(23) =2284453a(24) =604117a(25) =191981609a(26) =1530787a(27) =13747361a(28) =3568661a(29) =769757

External references