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 A372255 #39 May 28 2025 11:14:23
%S A372255 1,3,5,11,34,149,846,5767,45368,403209,3991690,43545611,518918412,
%T A372255 6706022413,93405312014,1394852659215,22230464256016,376610217984017,
%U A372255 6758061133824018,128047474114560019,2554547108585472020,53523844179886080021,1175091669949317120022,26976017466662584320023
%N A372255 a(1) = 1, a(n) = n*(n-2)! + n - 1.
%C A372255 Arises from studying a certain card trick.
%C A372255 [In response to a question, the author tells me this is based on Secton 2.3.3 of https://arxiv.org/pdf/2405.21007 . I have asked her to add a link here to that paper, and also to any other sequences mentioned there. - _N. J. A. Sloane_, Jul 05 2024]
%H A372255 Michael Kleber and Ravi Vakil, <a href="https://web.northeastern.edu/seigen/11Magic/Articles/Best%20Card%20Trick.pdf">The best card trick</a>, The Mathematical Intelligencer 24 (2002), 9-11.
%H A372255 Aria Chen, Tyler Cummins, Rishi De Francesco, Jate Greene, Alexander Meng, Tanish Parida, Anirudh Pulugurtha, Anand Swaroop, Samuel Tsui, and Tanya Khovanova, <a href="https://arxiv.org/abs/2405.21007">Card Tricks and Information</a>, arXiv 2405.21007 [math.HO], 2024.
%F A372255 a(n) = A341302(n-1) + 2 for n > 1.
%F A372255 D-finite with recurrence a(n) +(-n+1)*a(n-1) +(n-4)*a(n-3) +(4*n-13) = 0. - _R. J. Mathar_, May 24 2024
%F A372255 E.g.f.: 1 + x - exp(x)*(1 - x) - x*log(1 - x). - _Stefano Spezia_, May 24 2024
%t A372255 Join[{1},Table[n(n - 2)! + n - 1, {n,2,30}]]
%Y A372255 Cf. A341302, A370888, A371217.
%K A372255 nonn
%O A372255 1,2
%A A372255 _Tanya Khovanova_ and the MIT PRIMES STEP junior group, Apr 24 2024