|
Search: id:A090469
|
|
|
| A090469 |
|
Least (distinct) composite k such that k+n, k+2n, k+3n, ... up to n terms are all composite. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 (wasserma(AT)spawar.navy.mil), Nov 08 2005
|
|
CROSSREFS
|
Sequence in context: A092727 A020842 A090325 this_sequence A096427 A021122 A110233
Adjacent sequences: A090466 A090467 A090468 this_sequence A090470 A090471 A090472
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 02 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Nov 08 2005
|
|
|
Search completed in 0.002 seconds
|
