login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127696 a(n) = (2*n)^n+(2*n+1)^n-(2*n+2)^n. 1
1, 1, 5, 47, 657, 12219, 283257, 7837423, 250764161, 9046988147, 359958186777, 15446916156231, 696035549765025, 31596603724765195, 1320452505741997625, 35237128887524220383, -2148849686515840130559, -600767230517127657730077, -91881507441808204259686119 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Theorem: (2*n)^n > (2*n+1)^n + (2*n+2)^n for 1 <= n <= 15.
REFERENCES
D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 192, 3.1.13.
LINKS
FORMULA
a(n) = (2*n)^n*(1+sqrt(e)-e + O(1/n)) as n -> infinity. - Robert Israel, Feb 16 2018
MAPLE
f:= n -> (2*n)^n+(2*n+1)^n-(2*n+2)^n:
map(f, [$0..30]); # Robert Israel, Feb 16 2018
CROSSREFS
Sequence in context: A006902 A367079 A180254 * A088691 A052802 A098799
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Apr 03 2007
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 21:44 EDT 2024. Contains 372020 sequences. (Running on oeis4.)