login
This site is supported by donations 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; internal format)
OFFSET

0,3

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: A073734 A062558 A072789 * A200648 A134674 A000121

Adjacent sequences:  A126299 A126300 A126301 * A126303 A126304 A126305

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jan 02 2007

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 February 15 23:53 EST 2012. Contains 205860 sequences.