login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094263 Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k. 3
0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 2, 1, 0, 0, 0, 2, 0, 3, 4, 1, 0, 0, 1, 0, 1, 4, 3, 2, 1, 0, 0, 0, 1, 0, 0, 4, 3, 0, 1, 0, 0, 1, 2, 1, 1, 1, 4, 1, 8, 1, 0, 0, 0, 0, 0, 2, 0, 5, 0, 0, 4, 1, 0, 0, 1, 1, 1, 3, 1, 6, 1, 1, 9, 2, 1, 0, 0, 0, 2, 0, 4, 4, 0, 0, 8, 6, 3, 4, 1, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,13

CROSSREFS

Cf. A094264, A094265.

Sequence in context: A037876 A161519 A068101 * A049761 A030618 A025448

Adjacent sequences:  A094260 A094261 A094262 * A094264 A094265 A094266

KEYWORD

nonn,easy,tabl,less

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 26 2004

EXTENSIONS

Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Jan 24 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 17:52 EST 2012. Contains 205651 sequences.