Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 13 2022 08:25:30
%S 0,1,7,1,21,25,44,41,43,41,114,73,160,85,184,249,13,157,157,241,37,
%T 433,12,433,34,61,403,473,107,169,753,777,256,825,151,769,7,577,511,
%U 1129,102,1009,1350,465,334,1513,341,1345,1108,2441
%N a(n) = prime(n)^2 mod n^2.
%F a(n) = A001248(n) mod A000290(n). [Corrected by _Georg Fischer_, Dec 13 2022]
%t Table[PowerMod[Prime[n],2,n^2],{n,50}] (* _Harvey P. Dale_, Jan 23 2013 *)
%Y Cf. A000290, A178211.
%K nonn
%O 1,3
%A _Juri-Stepan Gerasimov_, Dec 22 2010
%E Corrected by _R. J. Mathar_, Dec 22 2010