|
Search: id:A136798
|
|
|
| A136798 |
|
Composite runs >2: first term. |
|
+0
5
|
|
| 8, 14, 20, 24, 32, 38, 44, 48, 54, 62, 68, 74, 80, 84, 90, 98, 104, 110, 114, 128, 132, 140, 152, 158, 164, 168, 174, 182, 194, 200, 212, 224, 230, 234, 242, 252, 258, 264, 272, 278, 284, 294, 308, 314, 318, 332, 338, 350, 354, 360, 368, 374, 380, 384, 390, 398
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Suggested by Puzzle 430, Grimm's Conjecture, Carlos Rivera's The Prime Puzzles & Problems Connection
|
|
FORMULA
|
Find sequential runs >2 of composite N . All runs will have an odd number of terms.
a(n) = A049591(n)+1 . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 23 2008
|
|
EXAMPLE
|
a(1)=8 because 8 is the first term in a sequential run of 3 composites, 8,9,10
|
|
CROSSREFS
|
Cf. A136799 A136800 A136801.
Adjacent sequences: A136795 A136796 A136797 this_sequence A136799 A136800 A136801
Sequence in context: A025044 A125163 A063288 this_sequence A091575 A091572 A096786
|
|
KEYWORD
|
easy,nonn,uned
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Jan 21 2008
|
|
|
Search completed in 0.002 seconds
|
