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!)
A096103 Table read by rows: row n contains the quadratic residues modulo n which are coprime to n. 1

%I #17 Apr 06 2024 20:30:19

%S 1,1,1,1,4,1,1,2,4,1,1,4,7,1,9,1,3,4,5,9,1,1,3,4,9,10,12,1,9,11,1,4,1,

%T 9,1,2,4,8,9,13,15,16,1,7,13,1,4,5,6,7,9,11,16,17,1,9,1,4,16,1,3,5,9,

%U 15,1,2,3,4,6,8,9,12,13,16,18,1,1,4,6,9,11,14,16,19,21,24,1,3,9,17,23,25,1,4

%N Table read by rows: row n contains the quadratic residues modulo n which are coprime to n.

%C Each '1' begins a row.

%C Row lengths are A046073. - _Geoffrey Critzer_, Jan 02 2015

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/QuadraticResidue.html">Quadratic Residue</a>

%e 1;

%e 1;

%e 1;

%e 1,4;

%e 1;

%e 1, 2, 4;

%e 1;

%e 1, 4, 7;

%e 1, 9;

%e 1, 3, 4, 5, 9;

%e 1;

%e 1, 3, 4, 9, 10, 12;

%e 1, 9, 11;

%e 1, 4;

%t Table[Union[Mod[Select[Range[n], CoprimeQ[#, n] &]^2, n]], {n, 2, 20}] // Grid (* _Geoffrey Critzer_, Jan 02 2015 *)

%o (PARI) maybesqgcd1(n) = { for(x=2,n, b=floor(x/2); a=vector(b+1); for(y=1,b, z=y^2%x; if(z<>0, a[y]=z; ) ); s=vecsort(a); c=1; for(j=2,b+1, if(s[j]<>s[j-1], c++; if(gcd(x,s[j])==1,print1(s[j]",")) ) ); ) }

%Y Cf. A046071, A046073.

%K nonn,tabf,changed

%O 2,5

%A _Cino Hilliard_, Jul 21 2004

%E Edited by _Don Reble_, Apr 16 2007

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 April 16 07:08 EDT 2024. Contains 371698 sequences. (Running on oeis4.)