|
| |
|
|
A137866
|
|
a(1)=0. For n >= 2, a(n) = GCD(a(n-1)+1, n).
|
|
0
| |
|
|
0, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 5, 6, 1, 2, 3, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 2, 3, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| Starting with a(1) = 1 instead leads to a(n) = n for every positive integer n.
|
|
|
MATHEMATICA
| a[1] := 0; a[n_] := a[n] = GCD[a[n - 1] + 1, n]; Table[a[n], {n, 82}] (* From Alonso del Arte, Feb 14 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A107286 A087039 A102096 * A072203 A124044 A059981
Adjacent sequences: A137863 A137864 A137865 * A137867 A137868 A137869
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet, Apr 29 2008
|
|
|
EXTENSIONS
| More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Feb 14 2011
|
| |
|
|
