Poulet numbers (Fermat pseudoprimes to base 2) k such that sopfr(k) is also a Poulet number, where sopfr(k) is the sum of the primes dividing k with repetition (A001414).

A329464

Poulet numbers (Fermat pseudoprimes to base 2) k such that sopfr(k) is also a Poulet number, where sopfr(k) is the sum of the primes dividing k with repetition (A001414).

Terms

    a(0) =261523801a(1) =407131165a(2) =762278161a(3) =1144998841a(4) =1267600105a(5) =1538242161a(6) =1618206745a(7) =1632785701a(8) =1984685185a(9) =2265650401a(10) =2607116865a(11) =2769136833a(12) =2830242961a(13) =3121418161a(14) =3521441665a(15) =4202755165a(16) =4320404641a(17) =4786205041a(18) =5013061801a(19) =5154023161a(20) =6647529601a(21) =6850760365

External references