|
Search: id:A136800
|
|
|
| A136800 |
|
Number of composites in prime gaps of size 3 or larger, in order of appearance. |
|
+0
5
|
|
| 3, 3, 3, 5, 5, 3, 3, 5, 5, 5, 3, 5, 3, 5, 7, 3, 3, 3, 13, 3, 5, 9, 5, 5, 3, 5, 5, 9, 3, 11, 11, 3, 3, 5, 9, 5, 5, 5, 5, 3, 9, 13, 3, 3, 13, 5, 9, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 9, 9, 5, 3, 5, 7, 3, 3, 11, 7, 3, 7, 3, 5, 11
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence counts the terms in the runs of composites associated with A136798-A136799.
A129856 is obtained by removing the composites (9, 15 etc) from this sequence.
This is sequence A046933, with the zero and all the 1's deleted. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 24 2008
|
|
FORMULA
|
a(n)=A136799(n)-A136798(n)+1.
|
|
EXAMPLE
|
a(1)=3 because in the run 8, 9, 10 there are three terms.
|
|
CROSSREFS
|
Cf. A136798, A136799, A136801.
Sequence in context: A083574 A108025 A129856 this_sequence A126661 A162226 A001650
Adjacent sequences: A136797 A136798 A136799 this_sequence A136801 A136802 A136803
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Jan 22 2008
|
|
EXTENSIONS
|
Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 27 2009
|
|
|
Search completed in 0.002 seconds
|
