Squarefree composite numbers n such that b^n == b (mod gpf(n)) for every integer b, where gpf(n) = A006530(n).
A276832
Squarefree composite numbers n such that b^n == b (mod gpf(n)) for every integer b, where gpf(n) = A006530(n).
Terms
- a(0) =231a(1) =561a(2) =1045a(3) =1105a(4) =1653a(5) =1729a(6) =2465a(7) =2821a(8) =3059a(9) =3655a(10) =4371a(11) =4641a(12) =5005a(13) =5083a(14) =5365a(15) =5565a(16) =6545a(17) =6601a(18) =7337a(19) =8029a(20) =8695a(21) =8911a(22) =9361a(23) =10011a(24) =10585a(25) =10857a(26) =10879a(27) =11077a(28) =11305a(29) =12121
External references
- oeis: A276832