|
| |
|
|
A113646
|
|
a(n) is the smallest composite integer which is >= n.
|
|
7
|
|
|
|
4, 4, 4, 4, 6, 6, 8, 8, 9, 10, 12, 12, 14, 14, 15, 16, 18, 18, 20, 20, 21, 22, 24, 24, 25, 26, 27, 28, 30, 30, 32, 32, 33, 34, 35, 36, 38, 38, 39, 40, 42, 42, 44, 44, 45, 46, 48, 48, 49, 50, 51, 52, 54, 54, 55, 56, 57, 58, 60, 60, 62, 62, 63, 64, 65, 66, 68, 68, 69, 70, 72, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(1) = a(2) = 4. For n >= 3, a(n) = A014683(n).
|
|
|
MAPLE
|
# This Maple program returns the smallest composite greater than n - N. J. A. Sloane, Sep 11 2019
iscomp := n-> if isprime(n) or (n=1) then false else true; fi;
f := proc(n) local a; global iscomp; a:=n+1; while not iscomp(a) do a:=a+1; od; a; end;
|
|
|
MATHEMATICA
|
Table[k = n; While[! CompositeQ@ k, k++]; k, {n, 72}] (* Michael De Vlieger, Sep 06 2017 *)
|
|
|
PROG
|
(Haskell)
a113646 n = if n < 3 then 4 else a014683 n
-- Reinhard Zumkeller, Nov 01 2014
(Python)
from sympy import isprime
def a(n):
an = max(4, n)
while isprime(an): an += 1
return an
print([a(n) for n in range(1, 73)]) # Michael S. Branicky, Apr 04 2021
|
|
|
CROSSREFS
|
Cf. A002808, A014683.
Sequence in context: A139324 A111655 A175961 * A106325 A159835 A240835
Adjacent sequences: A113643 A113644 A113645 * A113647 A113648 A113649
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Leroy Quet, Jan 15 2006
|
|
|
STATUS
|
approved
|
| |
|
|
