a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).

A260531

a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).

Terms

    a(0) =1a(1) =0a(2) =21a(3) =1a(4) =45a(5) =79a(6) =120a(7) =305a(8) =484a(9) =697a(10) =404a(11) =186a(12) =1354a(13) =603a(14) =612a(15) =2757a(16) =945a(17) =3051a(18) =3552a(19) =498a(20) =950a(21) =1186a(22) =2657a(23) =1781a(24) =6403a(25) =9192a(26) =8035a(27) =1927a(28) =2181a(29) =2713

External references