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 A290038 #10 Mar 12 2025 10:48:21 %S A290038 34459425,2618916300,108030297375,3211227869850,77083218186975, %T A290038 1588144599241200,29158562820672285,489227666491814250, %U A290038 7636058324659014250,112346788172994575200,1573773827894456037850,21155069633041246602700,274588861338588612866050 %N A290038 Number of set partitions of [n] having exactly nine blocks of size > 1. %H A290038 Alois P. Heinz, <a href="/A290038/b290038.txt">Table of n, a(n) for n = 18..1000</a> %H A290038 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %H A290038 <a href="/index/Rec#order_55">Index entries for linear recurrences with constant coefficients</a>, order 55. %F A290038 E.g.f.: (exp(x)-x-1)^9/9!*exp(x). %F A290038 a(0) = a(1) = 0, for n>1 a(n) = 10*a(n-1) + (n-1)*A290037(n-2). - _Ray Chandler_, Jul 21 2017 %Y A290038 Column k=9 of A124324. %Y A290038 Cf. A290037. %K A290038 nonn,easy %O A290038 18,1 %A A290038 _Alois P. Heinz_, Jul 18 2017