|
| |
|
|
A096008
|
|
Irregular triangle read by rows where n-th row contains all quadratic residues (including zero) mod n.
|
|
5
| |
|
|
0, 0, 1, 0, 1, 0, 1, 0, 1, 4, 0, 1, 3, 4, 0, 1, 2, 4, 0, 1, 4, 0, 1, 4, 7, 0, 1, 4, 5, 6, 9, 0, 1, 3, 4, 5, 9, 0, 1, 4, 9, 0, 1, 3, 4, 9, 10, 12, 0, 1, 2, 4, 7, 8, 9, 11, 0, 1, 4, 6, 9, 10, 0, 1, 4, 9, 0, 1, 2, 4, 8, 9, 13, 15, 16, 0, 1, 4, 7, 9, 10, 13, 16, 0, 1, 4, 5, 6, 7, 9, 11, 16, 17, 0, 1, 4, 5, 9
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,10
|
|
|
LINKS
| T. D. Noe, Rows n = 1..100, flattened
Eric Weisstein's World of Mathematics, Quadratic Residue.
|
|
|
EXAMPLE
| The table starts: [0]
[0, 1]
[0, 1]
[0, 1]
[0, 1, 4]
[0, 1, 3, 4]
[0, 1, 2, 4]
[0, 1, 4]
[0, 1, 4, 7]
[0, 1, 4, 5, 6, 9]
...
|
|
|
MAPLE
| q:=n-> sort(convert({seq(i^2 mod n, i=0..n-1)}, list)); [N. J. A. Sloane, Feb 09 2011]
|
|
|
PROG
| (PARI) T(n) = {local(v, r, i, j, k); v=vector(n, i, 0); for(i=0, floor(n/2), v[i^2%n+1]=1); k=sum(i=1, n, v[i]); j=0; r=vector(k); for(i=1, n, if(v[i], j++; r[j]=i-1)); r}
|
|
|
CROSSREFS
| Cf. A046071 (without zeros), A000224 (row lengths), A063987.
Sequence in context: A096793 A155998 A127538 * A122873 A176803 A115715
Adjacent sequences: A096005 A096006 A096007 * A096009 A096010 A096011
|
|
|
KEYWORD
| easy,tabf,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Jul 20 2004
|
|
|
EXTENSIONS
| Edited by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Nov 07 2006
|
| |
|
|
