The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076919 a(1) = 1, a(2) = 2, then a(n+1) is the smallest number such that the highest common factor of a(n) and a(n+1) is different from that of a(n) and a(n-1) and is more than 1. 1
1, 2, 4, 8, 10, 15, 18, 20, 24, 26, 39, 42, 44, 48, 50, 55, 66, 68, 72, 74, 111, 114, 116, 120, 122, 183, 186, 188, 192, 194, 291, 294, 296, 300, 302, 453, 456, 458, 687, 690, 692, 696, 698, 1047, 1050, 1052, 1056, 1058, 1081, 1128, 1130, 1135, 1362, 1364, 1368, 1370, 1375, 1386, 1388, 1392 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
15 follows 10 as (8,10) = 2 so 12 and 14 are ruled out.
MATHEMATICA
a[1] = 1; a[2] = 2;
a[n_] := a[n] = Module[{k}, For[k = a[n-1] + 1, True, k++, If[GCD[a[n-1], a[n-2]] != GCD[k, a[n-1]] && GCD[k, a[n-1]] > 1, Return[k]]]];
Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Oct 25 2023 *)
CROSSREFS
Cf. A076920.
Sequence in context: A323102 A331627 A102431 * A336659 A341655 A171757
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Oct 17 2002
EXTENSIONS
More terms from Jean-François Alcover, Oct 25 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 20:41 EDT 2024. Contains 372494 sequences. (Running on oeis4.)