login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126302 a(n) = Sum of peak heights of the n-th Dyck-path encoded by A014486(n). 2
0, 1, 2, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 4, 4, 4, 5, 6, 5, 4, 5, 6, 4, 5, 5, 5, 6, 5, 5, 5, 6, 7, 6, 5, 6, 7, 5, 5, 5, 5, 6, 5, 6, 6, 7, 8, 7, 6, 7, 8, 6, 5, 5, 6, 7, 6, 7, 8, 9, 7, 5, 6, 7, 8, 5, 6, 6, 6, 7, 6, 6, 6, 7, 8, 7, 6, 7, 8, 6, 6, 6, 6, 7, 6, 7, 7, 8, 9, 8, 7, 8, 9, 7, 6, 6, 7, 8, 7, 8, 9, 10, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A125989(A014486(n)).
EXAMPLE
A014486(2) = 10 (1010 in binary) which encodes Dyck path /\/\ with two peaks at height=1, thus a(2)=2.
CROSSREFS
a(n) = a(A125976(n)) for all n.
Sequence in context: A271237 A062558 A072789 * A200648 A264982 A134674
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)