a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.

A327787

a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.

Terms

    a(0) =1729a(1) =252601a(2) =1152271a(3) =1615681a(4) =4335241a(5) =172947529a(6) =214852609a(7) =79624621a(8) =178837201a(9) =775368901a(10) =686059921a(11) =985052881a(12) =5781222721a(13) =10277275681a(14) =84350561a(15) =5255104513a(16) =492559141a(17) =74340674101a(18) =9293756581a(19) =1200778753a(20) =129971289169a(21) =2230305949a(22) =851703301a(23) =8714965001a(24) =6693621481

External references