login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341300 a(n) = n!+(n-1)!+(n-2)!+(n-3)!+n-3. 1

%I

%S 10,34,154,873,5908,46205,408966,4037047,43948808,522910089,

%T 6749568010,93924230411,1401558681612,22323869568013,378005070643214,

%U 6780291598080015,128424084332544016,2561305169719296017,53651891654000640018,1177646217057902592019

%N a(n) = n!+(n-1)!+(n-2)!+(n-3)!+n-3.

%H Michael De Vlieger, <a href="/A341300/b341300.txt">Table of n, a(n) for n = 3..449</a>

%H Michael Engen and Vincent Vatter, <a href="https://doi.org/10.1080/00029890.2021.1835384">Containing all permutations</a>, Amer. Math. Monthly, 128 (2021), 4-24; <a href="https://arxiv.org/abs/1810.08252">arXiv preprint</a>, arXiv:1810.08252 [math.CO], 2018-2020.

%t Array[Total[(# - Range[0, 3])!] + # - 3 &, 20, 3] (* _Michael De Vlieger_, Apr 07 2021 *)

%K nonn

%O 3,1

%A _N. J. A. Sloane_, Feb 13 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 16:15 EDT 2021. Contains 347670 sequences. (Running on oeis4.)