cp's OEIS Frontend

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.

A127610 a(n) = floor(( (n+1)/2 )^n) - n!.

This page as a plain text file.
%I A127610 #9 Jan 29 2024 15:38:34
%S A127610 0,0,0,2,15,123,1118,11344,127831,1590245,21700716,322880256,
%T A127610 5209007463,90661989607,1694616510154,33876697720832,721588072472639,
%U A127610 16321494271570569,390811944752490542,9878354899591168000,262896868506265373394,7349159002086450661211
%N A127610 a(n) = floor(( (n+1)/2 )^n) - n!.
%C A127610 Theorem (Cauchy): ((n+1)/2)^n > n! for n >= 2.
%D A127610 D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 192, 3.1.14.
%H A127610 Paolo Xausa, <a href="/A127610/b127610.txt">Table of n, a(n) for n = 0..420</a>
%t A127610 A127610[n_] := Floor[((n+1)/2)^n] - n!;
%t A127610 Array[A127610, 25, 0] (* _Paolo Xausa_, Jan 29 2024 *)
%Y A127610 Cf. A127426.
%K A127610 nonn
%O A127610 0,4
%A A127610 _N. J. A. Sloane_, Apr 03 2007