|
Search: id:A092913
|
|
|
| A092913 |
|
a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n. |
|
+0
1
|
|
| 1, 9, 117, 117, 1404, 5616, 5616, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 190944, 3246048, 3246048, 38952576, 38952576, 38952576, 38952576, 38952576, 38952576
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
a(2) = a(3) = 117 = 9*13 and all the numbers from 117-2 = 115 to 117+2 = 119 are
composite.
|
|
MATHEMATICA
|
f[s_] := Block[{k, n, inc}, n = Length[s]; k = inc = Last[s]; While[Or @@ PrimeQ /@ Range[k - n, k + n], k += inc]; Append[s, k]]; Nest[f, {1}, 30] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A082723 A012116 A083305 this_sequence A022607 A139740 A062994
Adjacent sequences: A092910 A092911 A092912 this_sequence A092914 A092915 A092916
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 15 2004
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 23 2006
|
|
|
Search completed in 0.002 seconds
|
