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 A036918 #46 May 19 2025 15:58:49
%S A036918 0,2,10,48,260,1630,11742,95900,876808,8877690,98641010,1193556232,
%T A036918 15624736140,220048367318,3317652307270,53319412081140,
%U A036918 909984632851472,16436597430879730,313262209859119578,6282647653285676000,132266266384961600020,2916471173788403280462
%N A036918 a(n) = floor(e*(n-1)*(n-1)!).
%C A036918 Also the number of positive integers with all distinct digits expressed in base n. E.g., a(10) = Sum_{j=1..10} A073531(j). - _Labos Elemer_, Dec 05 2002
%C A036918 For example, for n=3 we have 1, 2, 10, 12, 20, 21, 102, 120, 201, 210 (10 numbers in total). - _Igor Krasikov_, Aug 14 2023
%F A036918 G.f.: Q(0)/(2*x) - 1/x - 1/(1-x), where Q(k) = 1 + 1/(1 - x*(k+1)/(x*(k+1) + (1-x)/Q(k+1) )); (continued fraction). - _Sergei N. Gladkovskii_, Aug 08 2013
%F A036918 a(n) = 2*(A038155(n) - A038155(n-1)). - _Anton Zakharov_, Oct 13 2016
%t A036918 Table[Apply[Plus, Table[((b-1)/b)*Binomial[b, j]*j!, {j, 1, b}]], {b, 1, 25}]
%t A036918 Table[Floor[E(n-1)(n-1)!],{n,25}] (* _Harvey P. Dale_, May 19 2025 *)
%Y A036918 Cf. A001113, A073531, A073532.
%Y A036918 a(n) = A001339(n)-1.
%Y A036918 Equals (n-1)*A000522(n-1).
%K A036918 nonn
%O A036918 1,2
%A A036918 _N. J. A. Sloane_