login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145384 The number of terms of A050791 bracketed by successive terms of A141326 2
0, 1, 2, 3, 2, 3, 2, 2, 6, 6, 0, 3, 1, 3, 2, 3, 2, 4, 4, 3, 0, 3, 5, 0, 2, 2, 3, 2, 1, 2, 3, 1, 2, 3, 5, 1, 1, 4, 2, 0, 1, 3, 1, 3, 3, 2, 2, 2, 4, 2, 1, 2, 4, 2, 0, 1, 2, 3, 1, 1, 1, 3, 0, 3, 1, 0, 3, 1, 1, 4, 2, 2, 1, 3, 3, 1, 2, 0, 3, 2, 5, 1, 1, 3, 6, 2, 4, 1, 0, 5, 2, 2, 2, 2, 3, 2, 3, 3, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

A141326 is a simply generated subsequence of A050791 and by observation it forms a natural measure of the parent sequence. The first several hundred terms of the parent sequence not belonging to A141326 are bracketed into groups with a small integral number of terms ( including 0 ) by the successive terms of the subsequence, A141326.

a(107),a(108) are the first occurrence of 2 consecutive 0's and a(119),a(120),a(121) are the first occurrence of 3 consecutive 0's. This leads to the following conjecture:

<a(n)> -> 0 as n ->inf

where <a(n)> = ( sum m=1,n of a(m) )/n

LINKS

Lewis Mammel, Table of n, a(n) for n = 1..122

FORMULA

a(1) = A145383(1) - 1

a(n) = A145383(n) - A145383(n-1) - 1 ; n>1

EXAMPLE

0 = number of terms of A050791 preceding the first term of A141326

1 = number of terms of A050791 between the first and 2nd terms of A141326

2 = number of terms of A050791 between the 2nd and 3rd terms of A141326

CROSSREFS

Cf. A145383, A141326, A050791

Sequence in context: A175066 A066102 A036048 * A117666 A165587 A010693

Adjacent sequences:  A145381 A145382 A145383 * A145385 A145386 A145387

KEYWORD

nonn

AUTHOR

Lewis Mammel (l_mammel(AT)att.net), Oct 10 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 23:59 EDT 2013. Contains 225436 sequences.