Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A084107
%S A084107 0,2,50,14642,1016674610,4489135110542145842,
%T A084107 83940259113354708787282267381662562610,
%U A084107 28755706180189132304920279902696353117047700481289459579932708798287463397682
%N A084107 A014486-encoding of "Complete Binary Trees".
%C A084107 "Complete" or "full binary tree" refers to a unique binary tree of (2^n)-1 
               nodes with its 2^(n-1) leaves all on the same height (or depth) n-1 
               (when the root is at height 0). These are depicted at A073346. This 
               differs from "completely binary tree", with which some authors refer 
               to trees more akin to the trees encoded by A080299.
%H A084107 <a href="Sindx_Ro.html#RootedTreePlanEncodings">Index entries for encodings 
               of plane rooted trees</a>
%Y A084107 a(n) = A014486(A084108(n)). Subset of A083941.
%Y A084107 Sequence in context: A088920 A079198 A080293 this_sequence A057943 A037419 
               A078165
%Y A084107 Adjacent sequences: A084104 A084105 A084106 this_sequence A084108 A084109 
               A084110
%K A084107 nonn
%O A084107 0,2
%A A084107 Antti Karttunen (MyFirstname.MySurname(AT)iki.fi) May 13 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research