Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080293
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080293 A014486-encoding of the branch-reduced binomial-mod-2 binary trees. +0
13
2, 50, 14642, 3969842, 267572689202, 69427226972978, 4581045692538239282, 301220569271221714981682, 1295918094920364850246919050705202, 332029112115571675270693117549056818 (list; graph; listen)
OFFSET

0,1

COMMENT

These are obtained from the stunted binomial-mod-2 zigzag trees (A080263) either by extending each leaf to a branch of two leaves, or by branch-reducing every other such tree.

FORMULA

a(n) = A080310(A080263(n)) = A014486(A080298(A080265(n))) = A014486(A080979(A080265(2*n)))

CROSSREFS

a(n) = A014486(A080295(n)). Same sequence in binary: A080294. Breadth-first-wise encoding: A080318. "Moose-trees" obtained from these: A080973. Cf. A080292, A080297.

Sequence in context: A080263 A088920 A079198 this_sequence A084107 A057943 A037419

Adjacent sequences: A080290 A080291 A080292 this_sequence A080294 A080295 A080296

KEYWORD

nonn

AUTHOR

Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Mar 02 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research