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!)
A061711 a(n) = n!*n^n. 20
1, 1, 8, 162, 6144, 375000, 33592320, 4150656720, 676457349120, 140587147048320, 36288000000000000, 11388728893445164800, 4270826380475341209600, 1886009588552176549862400, 968725766854884321342259200, 572622616354851562500000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(n) is the product of first n terms of an arithmetic progression with first term n and common difference n. E.g. a(3) = 3*6*9 = 162. - Amarnath Murthy, Sep 20 2003
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..100 (corrected by Michel Marcus, Jan 19 2019)
FORMULA
E.g.f.: sinh(n*x)^n. - Vaclav Kotesovec, Nov 05 2014
a(n) = [x^n] 1/(1 - n*x/(1 - n*x/(1 - 2*n*x/(1 - 2*n*x/(1 - 3*n*x/(1 - 3*n*x/(1 - ...))))))), a continued fraction. - Ilya Gutkovskiy, Sep 20 2017
Sum_{n>=1} 1/a(n) = A336765. - Amiram Eldar, Nov 20 2020
a(n) ~ exp(-n)*n^(2*n)*sqrt(2*n*Pi). - Peter Luschny, Jan 10 2022
EXAMPLE
a(1) = 1!*1^1 = 1.
a(2) = 2!*2^2 = 8.
a(3) = 3!*3^3 = 162.
MATHEMATICA
Table[If[n == 0, 1, n^n] * n!, {n, 0, 20}] (* Vaclav Kotesovec, Mar 08 2018 *)
PROG
(PARI) a(n) = n!*n^n; \\ Harry J. Smith, Jul 26 2009
(Python)
from math import factorial
def A061711(n): return factorial(n)*n**n # Chai Wah Wu, Sep 03 2022
(Magma) [Factorial(n)*n^n: n in [0..30]]; // G. C. Greubel, Nov 29 2022
CROSSREFS
Main diagonal of A131182.
Cf. A336765.
Sequence in context: A061250 A183813 A222274 * A316998 A075387 A143857
KEYWORD
easy,nonn
AUTHOR
Lorenzo Fortunato (fortunat(AT)pd.infn.it), Jun 19 2001
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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)