The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100996 a(1) = 1; a(n) is smallest positive integer such that a(n)*a(n-1)+1 is coprime to n. 0
 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; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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: A319700 A279104 A165509 * A232504 A292201 A343070 Adjacent sequences:  A100993 A100994 A100995 * A100997 A100998 A100999 KEYWORD nonn AUTHOR Leroy Quet, Jan 13 2005 EXTENSIONS More terms from Robert G. Wilson v, Feb 11 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 29 23:58 EDT 2021. Contains 346346 sequences. (Running on oeis4.)