login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053673 Least number coprime to n, n+1, n+2, n+3 and n+4. 3
7, 7, 11, 11, 11, 11, 13, 7, 7, 17, 17, 11, 11, 11, 7, 7, 11, 13, 13, 13, 13, 7, 7, 11, 11, 11, 11, 11, 7, 7, 13, 13, 13, 11, 11, 7, 7, 11, 11, 13, 13, 13, 7, 7, 11, 11, 11, 11, 11, 7, 7, 17, 13, 13, 13, 11, 7, 7, 11, 11, 11, 17, 17, 7, 7, 13, 11, 11, 11, 11, 7, 7, 13, 17, 17, 17, 17 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

MATHEMATICA

Table[k=2; While[First[Union[CoprimeQ[k, #]&/@(n+Range[0, 4])]]== False, k++]; k, {n, 80}] (* From Harvey P. Dale, Jul 07 2011 *)

PROG

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (fromJust)

a053673 n = 2 + fromJust

   (elemIndex 1 $ map (gcd $ foldl1 lcm $ take 5 [n..]) [2..])

-- Reinhard Zumkeller, Sep 25 2011

CROSSREFS

Cf. A053669-A053674.

Sequence in context: A064496 A084513 A084523 * A204910 A152672 A003883

Adjacent sequences:  A053670 A053671 A053672 * A053674 A053675 A053676

KEYWORD

nonn,easy,nice

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Feb 15 2000

EXTENSIONS

More terms from Andrew Gacek (andrew(AT)dgi.net), Feb 21 2000 and James A. Sellers (sellersj(AT)math.psu.edu), Feb 22 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.