Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080071 Top-level length of each parenthesization/root degree of general trees encoded in A080070. +0
4
0, 1, 2, 2, 3, 2, 3, 3, 3, 2, 4, 2, 3, 3, 3, 3, 4, 3, 2, 3, 4, 4, 3, 3, 2, 4, 2, 3, 4, 3, 2, 4, 3, 3, 3, 4, 3, 2, 3, 4, 3, 2, 3, 6, 3, 3, 3, 4, 3, 3, 3, 3, 3, 2, 4, 3, 2, 4, 5, 3, 2, 4, 3, 2, 3, 3, 4, 2, 4, 3, 2, 3, 5, 2, 4, 2, 6, 3, 3, 3, 3, 3, 2, 4, 2, 3, 4, 5, 5, 3, 3, 2, 5, 2, 5, 2, 3, 4, 2, 4, 3, 3, 4, 3, 2 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = A057515(A080068(n))

CROSSREFS

Cf. A080070, A080090.

Sequence in context: A100198 A164996 A136510 this_sequence A019569 A003434 A097849

Adjacent sequences: A080068 A080069 A080070 this_sequence A080072 A080073 A080074

KEYWORD

nonn

AUTHOR

Antti Karttunen (Firstname.Surname(AT)iki.fi) Jan 27 2003

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research