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 A245755 #4 Aug 01 2014 12:36:54 %S A245755 15,147,1003,5286,24396,101768,395410,1452251,5104104,17300428, %T A245755 56912396,182543809,573014123,1765525901,5352351017,15996845972, %U A245755 47213204699,137795770991,398168121417,1140238386377,3238947787201,9133172049405,25582174762816,71220487524663 %N A245755 Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 10. %H A245755 Alois P. Heinz, <a href="/A245755/b245755.txt">Table of n, a(n) for n = 42..800</a> %p A245755 b:= proc(n, i, t, k) option remember; `if`(n=0, 1, %p A245755 `if`(i<1, 0, add(binomial(b(i-1$2, k$2), j)* %p A245755 b(n-i*j, i-1, t-j, k), j=0..min(t, n/i)))) %p A245755 end: %p A245755 a:= n-> b(n-1$2, 10$2) -b(n-1$2, 9$2): %p A245755 seq(a(n), n=42..70); %Y A245755 Column k=10 of A244523. %K A245755 nonn %O A245755 42,1 %A A245755 _Joerg Arndt_ and _Alois P. Heinz_, Jul 31 2014