id:A100996 - OEIS Search Results

Search: id:A100996

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; a(n) is smallest positive integer such that a(n)*a(n-1)+1 is coprime to n.

+0
1

1, 2, 2, 1, 1, 4, 1, 2, 2, 1, 1, 4, 1, 2, 3, 2, 1, 4, 1, 2, 2, 1, 1, 4, 2, 1, 1, 2, 1, 6, 1, 2, 2, 1, 1, 4, 1, 2, 2, 1, 1, 4, 1, 2, 3, 2, 1, 4, 1, 2, 2, 1, 1, 4, 2, 1, 1, 2, 1, 6, 1, 2, 2, 1, 1, 4, 1, 2, 2, 1, 1, 4, 1, 2, 3, 2, 1, 4, 1, 2, 2, 1, 1, 4, 2, 1, 1, 2, 1, 6, 3, 2, 2, 1, 1, 4, 1, 2, 2, 1, 1, 4, 1, 2, 5 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	MATHEMATICA	`a[1] = 1; a[n_] := a[n] = Block[{k = 1}, While[ GCD[k*a[n - 1] + 1, n] != 1, k++ ]; k]; Table[ a[n], {n, 105}]`
	CROSSREFS	`Sequence in context: A033151 A046079 A165509 this_sequence A090048 A064285 A006694` `Adjacent sequences: A100993 A100994 A100995 this_sequence A100997 A100998 A100999`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Jan 13 2005`
	EXTENSIONS	`More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 11 2005`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research