id:A124223 - OEIS Search Results

Search: id:A124223

Displaying 1-1 of 1 results found.

page 1

Table T(n,k) = reciprocal of k modulo Prime(n), for 1 <= k < Prime(n).

+0
3

1, 1, 2, 1, 3, 2, 4, 1, 4, 5, 2, 3, 6, 1, 6, 4, 3, 9, 2, 8, 7, 5, 10, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 1, 9, 6, 13, 7, 3, 5, 15, 2, 12, 14, 10, 4, 11, 8, 16, 1, 10, 13, 5, 4, 16, 11, 12, 17, 2, 7, 8, 3, 15, 14, 6, 9, 18, 1, 12, 8, 6, 14, 4, 10, 3, 18, 7, 21, 2, 16, 5, 20, 13, 19, 9, 17, 15, 11 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`T(n,k) = smallest m such that k * m = 1 (mod Prime(n)). Prime(n) is the n-th prime: A000040(n).`
	LINKS	`Franklin T. Adams-Watters, Table of n, a(n) for n = 1..4181 (primes less than 200)` `Eric Weisstein's World of Mathematics, Modular Inverse`
	EXAMPLE	`Table starts: 1; 1,2; 1,3,2,4; 1,4,5,2,3,6; ....`
	CROSSREFS	`Cf. A124224, A102057, A000040, A006093 (row lengths).` `Sequence in context: A163507 A003963 A003960 this_sequence A094193 A108712 A003602` `Adjacent sequences: A124220 A124221 A124222 this_sequence A124224 A124225 A124226`
	KEYWORD	`nonn,tabf`
	AUTHOR	`Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Oct 20 2006`

page 1

Search completed in 0.004 seconds

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.

AT&T Labs Research