The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178445 a(n) = prime(n)^2 mod n^2. 0

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:17 EDT 2024. Contains 372533 sequences. (Running on oeis4.)