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!)
A178211 a(n) = prime(n)^2 mod n. 1

%I #12 Jun 27 2024 22:18:20

%S 0,1,1,1,1,1,2,1,7,1,4,1,4,1,4,9,13,13,5,1,16,15,12,1,9,9,25,25,20,19,

%T 9,9,25,9,11,13,7,7,4,9,20,1,17,25,19,41,12,1,30,41,25,25,46,37,49,9,

%U 28,13,29,1,57,41,1,17,14,37,16,9,4,1,4,1,4,9,16

%N a(n) = prime(n)^2 mod n.

%F a(n) = A001248(n) mod A000027(n).

%t f[n_] := Mod[Prime@ n^2, n]; Array[f, 75]

%Y Cf. A000027, A001248.

%K nonn

%O 1,7

%A _Juri-Stepan Gerasimov_, Dec 19 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 September 4 09:40 EDT 2024. Contains 375681 sequences. (Running on oeis4.)