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.

A036420 Number of ternary rooted trees with n nodes and height exactly 5.

This page as a plain text file.
%I A036420 #18 Mar 22 2024 08:56:04
%S A036420 0,0,0,0,0,1,4,13,32,74,155,316,612,1160,2126,3829,6737,11672,19856,
%T A036420 33332,55112,90014,145105,231200,363985,566692,872274,1328167,2000224,
%U A036420 2980316,4393106,6407555,9246741,13204470,18657868,26088224,36095090
%N A036420 Number of ternary rooted trees with n nodes and height exactly 5.
%H A036420 Sean A. Irvine, <a href="/A036420/b036420.txt">Table of n, a(n) for n = 0..121</a>
%H A036420 A. T. Balaban, J. W. Kennedy and L. V. Quintas, <a href="https://doi.org/10.1021/ed065p304">The number of alkanes having n carbons and a longest chain of length d</a>, J. Chem. Education, 65 (1988), 304-313.
%H A036420 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A036420 a(n) = A036373(n) - A036372(n). - _Sean A. Irvine_, Oct 31 2020
%Y A036420 Cf. A036370, A036437.
%K A036420 nonn,fini,full
%O A036420 0,7
%A A036420 _N. J. A. Sloane_, Eric Rains (rains(AT)caltech.edu)