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 A290039 #11 Mar 12 2025 10:49:34 %S A290039 654729075,59580345825,2924020048950,102811233675150,2903837588727075, %T A290039 70057683857786625,1499598592952460000,29215503851264230500, %U A290039 527544117129699920250,8948695357270547228350,144075089938915244609500,2219478078319305088785500 %N A290039 Number of set partitions of [n] having exactly ten blocks of size > 1. %H A290039 Alois P. Heinz, <a href="/A290039/b290039.txt">Table of n, a(n) for n = 20..966</a> %H A290039 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %H A290039 <a href="/index/Rec#order_66">Index entries for linear recurrences with constant coefficients</a>, order 66. %F A290039 E.g.f.: (exp(x)-x-1)^10/10!*exp(x). %F A290039 a(0) = a(1) = 0, for n>1 a(n) = 11*a(n-1) + (n-1)*A290038(n-2). - _Ray Chandler_, Jul 21 2017 %Y A290039 Column k=10 of A124324. %Y A290039 Cf. A290038. %K A290039 nonn,easy %O A290039 20,1 %A A290039 _Alois P. Heinz_, Jul 18 2017