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 A273659 #4 May 27 2016 12:35:36
%S A273659 21147,948280,24564100,483787480,8061693640,120120836836,
%T A273659 1653807555400,21489660580960,267385444371760,3218688299529560,
%U A273659 37768351403903120,434451231603262640,4920317819371507280,55047363589643246360,609969295304994614000,6708182596868603027936
%N A273659 Number of forests of labeled rooted trees of height at most 1, with n labels, nine of which are used for root nodes and any root may contain >= 1 labels.
%H A273659 Alois P. Heinz, <a href="/A273659/b273659.txt">Table of n, a(n) for n = 9..1000</a>
%F A273659 E.g.f.: x^9/9! * Sum_{j=0..9} Stirling2(9,j)*exp(x)^j.
%F A273659 a(n) = C(n,9) * Sum_{j=0..9} Stirling2(9,j) * j^(n-9).
%p A273659 a:= n-> binomial(n,9)*add(Stirling2(9,j)*j^(n-9), j=0..9):
%p A273659 seq(a(n), n=9..40);
%Y A273659 Column k=9 of A143396.
%K A273659 nonn
%O A273659 9,1
%A A273659 _Alois P. Heinz_, May 27 2016