login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A090469
Least (distinct) composite k such that k+n, k+2n, k+3n, ... up to n terms are all composite.
0
8, 4, 6, 10, 15, 9, 14, 12, 18, 16, 22, 20, 26, 21, 24, 28, 34, 27, 38, 25, 30, 32, 46, 33, 35, 36, 39, 40, 58, 42, 62, 44, 45, 48, 49, 50, 74, 52, 51, 54, 82, 56, 86, 55, 57, 60, 94, 63, 70, 64, 66, 65, 106, 68, 75, 72, 69, 76, 118, 78, 122, 80, 77, 84, 85, 81, 134, 88, 87, 90
OFFSET
1,1
COMMENTS
Conjectures: 1. For n > 1, a(n) is the least composite k not already used such that gcd(n, k) > 1. 2. For any prime p > 5, a(p) = 2p. - David Wasserman, Nov 08 2005
CROSSREFS
Sequence in context: A199434 A253073 A090325 * A322743 A168546 A195346
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Dec 02 2003
EXTENSIONS
More terms from David Wasserman, Nov 08 2005
STATUS
approved