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!)
A080823 a(n)=n for n<=4; for n>4, a(n) is the smallest integer greater than a(n-1) that shares common factors with some (i.e., at least one) but not all of previous 4 terms. 1
1, 2, 3, 4, 6, 8, 9, 10, 14, 15, 16, 21, 22, 25, 26, 27, 28, 32, 33, 34, 35, 36, 38, 39, 40, 44, 45, 46, 51, 52, 55, 56, 57, 58, 62, 63, 64, 68, 69, 70, 74, 75, 76, 77, 78, 80, 81, 82, 85, 86, 87, 88, 92, 93, 94, 98, 99, 100, 104, 105, 106, 111, 112, 115, 116, 117, 118, 122 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
For n >= 119, a(n) = a(n-113) + 210. - Robert Israel, Dec 21 2016
MAPLE
for n from 1 to 4 do A[n]:= n od:
for n from 5 to 100 do
for k from A[n-1]+1 do
L:= map(igcd, [seq(A[i], i=n-4..n-1)], k);
if max(L)>1 and min(L)=1 then A[n]:= k; break fi
od
od:
seq(A[i], i=1..100); # Robert Israel, Dec 21 2016
CROSSREFS
Cf. A079279.
Sequence in context: A158614 A303434 A362399 * A117925 A135571 A138394
KEYWORD
easy,nonn
AUTHOR
Matthew Vandermast, Mar 26 2003
EXTENSIONS
a(5)=6 inserted by Robert Israel, Dec 21 2016
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 April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)