Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #30 Mar 06 2024 04:43:55
%S 1,0,0,3,20,115,714,5033,40312,362871,3628790,39916789,479001588,
%T 6227020787,87178291186,1307674367985,20922789887984,355687428095983,
%U 6402373705727982,121645100408831981,2432902008176639980,51090942171709439979,1124000727777607679978
%N a(n) = n! - n.
%C McCombinations: in 2002, McDonald's advertised a McChoice menu of 8 items under the heading "40,312 combinations" rather than the more obvious 2^8-1=255 (A000225). The Advertising Standards Authority "considered that the number quoted in the advertisement was not necessarily so exaggerated as to be misleading". - _Henry Bottomley_, May 01 2003
%H Vincenzo Librandi, <a href="/A005096/b005096.txt">Table of n, a(n) for n = 0..300</a>
%H Advertising Standards Authority, <a href="https://web.archive.org/web/20040510130606/http://www.asa.org.uk/adjudications/show_adjudication.asp?adjudication_id=34845">McDonald's Restaurants Ltd</a> (archived May 10 2004).
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F a(n) = n*a(n-1)+n(n-2) = n*A033312(n-1) = A000142(n)-n. - _Henry Bottomley_, May 01 2003
%F E.g.f.: 1/(1 - x) - x*exp(x). - _Ilya Gutkovskiy_, Jan 27 2017
%p A005096:=n->n!-n: seq(A005096(n), n=0..25); # _Wesley Ivan Hurt_, Oct 28 2014
%t lst={};Do[AppendTo[lst, n!-n], {n, 3*4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 20 2008 *)
%t Table[n! - n, {n, 0, 25}] (* _Wesley Ivan Hurt_, Oct 28 2014 *)
%o (Magma) [Factorial(n) - n: n in [0..25]]; // _Vincenzo Librandi_, Jul 20 2011
%o (PARI) a(n)=n!-n \\ _Charles R Greathouse IV_, Oct 28 2014
%Y Cf. A000142, A033312.
%K nonn
%O 0,4
%A _N. J. A. Sloane_