Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126302 a(n) = Sum of peak heights of the n-th Dyck-path encoded by A014486(n). +0
3
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; listen)
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 this_sequence A134674 A000121 A049846

Adjacent sequences: A126299 A126300 A126301 this_sequence A126303 A126304 A126305

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research