Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060036
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060036 Triangular array T read by rows: T(n,k) = k^2 mod n, for k = 1,2,...,n-1, n = 2,3,... +0
3
1, 1, 1, 1, 0, 1, 1, 4, 4, 1, 1, 4, 3, 4, 1, 1, 4, 2, 2, 4, 1, 1, 4, 1, 0, 1, 4, 1, 1, 4, 0, 7, 7, 0, 4, 1, 1, 4, 9, 6, 5, 6, 9, 4, 1, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 1, 4, 9, 4, 1, 0, 1, 4, 9, 4, 1, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 1, 4, 9, 2, 11, 8, 7, 8, 11, 2, 9, 4, 1, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10 (list; table; graph; listen)
OFFSET

2,8

LINKS

T. D. Noe, Rows n=2..100 of triangle, flattened

EXAMPLE

1; 1,1; 1,0,1; 1,4,4,1; ...

CROSSREFS

Cf. A048152, A060037.

Sequence in context: A047214 A016496 A143253 this_sequence A046539 A108428 A075613

Adjacent sequences: A060033 A060034 A060035 this_sequence A060037 A060038 A060039

KEYWORD

nonn,tabl,easy,nice

AUTHOR

njas, Mar 17 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research