OFFSET
1,2
COMMENTS
Arises from studying a certain card trick.
[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]
LINKS
Michael Kleber and Ravi Vakil, The best card trick, The Mathematical Intelligencer 24 (2002), 9-11.
Aria Chen, Tyler Cummins, Rishi De Francesco, Jate Greene, Alexander Meng, Tanish Parida, Anirudh Pulugurtha, Anand Swaroop, Samuel Tsui, and Tanya Khovanova, Card Tricks and Information, arXiv 2405.21007 [math.HO], 2024.
FORMULA
a(n) = A341302(n-1) + 2 for n > 1.
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
E.g.f.: 1 + x - exp(x)*(1 - x) - x*log(1 - x). - Stefano Spezia, May 24 2024
MATHEMATICA
Join[{1}, Table[n(n - 2)! + n - 1, {n, 2, 30}]]
CROSSREFS
KEYWORD
nonn
AUTHOR
Tanya Khovanova and the MIT PRIMES STEP junior group, Apr 24 2024
STATUS
approved
