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.
%I A245103 #9 Dec 18 2020 06:32:52 %S A245103 1,1,4,18,93,498,2744,15349,86802,494769,2837412,16351036,94599339, %T A245103 549118128,3196397701,18651028188,109057492901,638863803720, %U A245103 3748605725140,22027421351633,129606128716906,763484925360476,4502370205339221,26577052185126059 %N A245103 Number of (2n+1)-node rooted trees of height n. %H A245103 Alois P. Heinz, <a href="/A245103/b245103.txt">Table of n, a(n) for n = 0..200</a> %F A245103 a(n) = A034781(2n+1,n). %F A245103 a(n) ~ c * d^n / sqrt(n), where d = 6.0313827950978605329935... (same as for A245102 and A339440), c = 0.14566140512597547487... . - _Vaclav Kotesovec_, Jul 12 2014 %Y A245103 Cf. A034781. %K A245103 nonn %O A245103 0,3 %A A245103 _Alois P. Heinz_, Jul 11 2014