Smallest b > 1 such that b^(p-1) == 1 (mod p^6) for p = prime(n).

A353939

Smallest b > 1 such that b^(p-1) == 1 (mod p^6) for p = prime(n).

Terms

    a(0) =65a(1) =728a(2) =1068a(3) =34967a(4) =284995a(5) =861642a(6) =390112a(7) =333257a(8) =2818778a(9) =42137700a(10) =8078311a(11) =33518159a(12) =92331463a(13) =21583010a(14) =138173066a(15) =8202731a(16) =390421192a(17) =1006953931a(18) =77622331a(19) =270657300a(20) =5915704483a(21) =522911165a(22) =2507851273a(23) =1329885769a(24) =2789067613a(25) =3987072867a(26) =7938255646

External references