login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126307 a(n) is the length of the leftmost ascent (i.e., height of the first peak) in the n-th Dyck path encoded by A014486(n). 6
0, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

In other words, this sequence gives the number of leading 1's in the terms of A063171.

LINKS

Table of n, a(n) for n=0..101.

FORMULA

a(n) = A090996(A014486(n)).

EXAMPLE

A014486(20) = 228 (11100100 in binary), encodes the following Dyck path:

    /\

   /  \/\

  /      \

and the first rising (left-hand side) slope has length 3, thus a(20)=3.

CROSSREFS

a(n) = A099563(A071156(n)) = A057515(A125985(n)) = A080237(A057164(n)) = A057515(A057504(A057164(n))).

Sequence in context: A029272 A153904 A128762 * A320838 A092332 A092334

Adjacent sequences:  A126304 A126305 A126306 * A126308 A126309 A126310

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 02 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 02:56 EDT 2021. Contains 345415 sequences. (Running on oeis4.)