id:A094263 - OEIS Search Results

Search: id:A094263

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k.

+0
4

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; listen)

	OFFSET	`1,13`
	CROSSREFS	`Cf. A094264, A094265.` `Sequence in context: A037876 A161519 A068101 this_sequence A049761 A030618 A025448` `Adjacent sequences: A094260 A094261 A094262 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research