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 A239914 #12 Feb 20 2025 09:30:33
%S A239914 1,4,17,92,633,5316,52609,598444,7685705,109933268,1732565841,
%T A239914 29824133436,556682481817,11198025452260,241481216430113,
%U A239914 5557135898411468,135927902927547369,3521462566184392692,96323049885512803825,2774010846129897006940,83898835844633970888761
%N A239914 Total number of preferential arrangements of 1, 2, ..., n things.
%C A239914 Although A217389 = a(n)+1 already exists, it is this sequence that one really needs.
%H A239914 Alois P. Heinz, <a href="/A239914/b239914.txt">Table of n, a(n) for n = 1..424</a>
%F A239914 a(n) = Sum_{k=1..n} A000670(k).
%F A239914 a(n) = A217389(n) - 1.
%p A239914 b:= proc(n, k) option remember;
%p A239914 `if`(n=0, k!, k*b(n-1, k)+b(n-1, k+1))
%p A239914 end:
%p A239914 a:= proc(n) option remember; `if`(n=0, 0, a(n-1)+b(n, 0)) end:
%p A239914 seq(a(n), n=1..23); # _Alois P. Heinz_, Feb 20 2025
%Y A239914 Cf. A000670, A217389.
%K A239914 nonn
%O A239914 1,2
%A A239914 _N. J. A. Sloane_, Apr 12 2014