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 A290037 #10 Mar 12 2025 10:47:14 %S A290037 2027025,126351225,4307428125,106546244805,2141473308975, %T A290037 37150564425975,577265949054795,8235084928545475,109751266389634870, %U A290037 1384084804861708950,16677998006092973550,193476119789167365150,2173729827868142994450,23766456155164279406850 %N A290037 Number of set partitions of [n] having exactly eight blocks of size > 1. %H A290037 Alois P. Heinz, <a href="/A290037/b290037.txt">Table of n, a(n) for n = 16..1000</a> %H A290037 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %H A290037 <a href="/index/Rec#order_45">Index entries for linear recurrences with constant coefficients</a>, order 45. %F A290037 E.g.f.: (exp(x)-x-1)^8/8!*exp(x). %F A290037 a(0) = a(1) = 0, for n>1 a(n) = 9*a(n-1) + (n-1)*A290036(n-2). - _Ray Chandler_, Jul 21 2017 %Y A290037 Column k=8 of A124324. %Y A290037 Cf. A290036. %K A290037 nonn,easy %O A290037 16,1 %A A290037 _Alois P. Heinz_, Jul 18 2017