cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A217299 Number of height minimal AVL trees with n (leaf-) nodes.

This page as a plain text file.
%I A217299 #16 Jun 26 2017 16:20:05
%S A217299 1,1,2,1,4,6,4,1,32,44,60,70,56,28,8,1,2720,4288,6312,9004,11992,
%T A217299 14372,15400,14630,11968,8104,4376,1820,560,120,16,1,31327104,
%U A217299 50882720,80963520,125489856,188637520,273984664,383305008,515461260,665277632,822361736
%N A217299 Number of height minimal AVL trees with n (leaf-) nodes.
%H A217299 Alois P. Heinz, <a href="/A217299/b217299.txt">Table of n, a(n) for n = 1..1024</a>
%H A217299 Wikipedia, <a href="https://en.wikipedia.org/wiki/AVL_tree">AVL tree</a>
%H A217299 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A217299 a(n) = A143897(A029837(n),n) = A217298(A029837(n),n).
%Y A217299 Cf. A217300.
%K A217299 nonn,look
%O A217299 1,3
%A A217299 _Alois P. Heinz_, Mar 17 2013