Numbers n such that 3^phi(n) == 1 (mod n^2), where phi(n) is Euler's totient function.

Terms

a(0) =11a(1) =22a(2) =44a(3) =55a(4) =110a(5) =220a(6) =440a(7) =880a(8) =1006003a(9) =2012006a(10) =4024012a(11) =11066033a(12) =22132066a(13) =44264132a(14) =55330165a(15) =88528264a(16) =110660330a(17) =221320660a(18) =442641320a(19) =885282640a(20) =1770565280a(21) =56224501667a(22) =112449003334a(23) =224898006668a(24) =393571511669a(25) =449796013336a(26) =618469518337a(27) =787143023338