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!)
A076111 Product of terms in n-th row of A076110. 3
1, 2, 15, 280, 9945, 576576, 49579075, 5925744000, 939536222625, 190787784140800, 48279601331512551, 14894665739501184000, 5502449072258318805625, 2397950328737212204032000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..230

FORMULA

a(n) = Prod_{k=1..n} (1+n*k). - Yalcin Aktar, Jul 14 2009

a(n) = n^n * Pochhammer(n, 1 + 1/n). - G. C. Greubel, Mar 04 2020

MAPLE

seq( mul(j*n+1, j=1..n), n=0..15); # G. C. Greubel, Mar 04 2020

MATHEMATICA

Table[Product[j*n+1, {j, n}], {n, 0, 15}] (* G. C. Greubel, Mar 04 2020 *)

PROG

(Maxima) A076111(n):=prod(1+n*k, k, 1, n)$

makelist(A076111(n), n, 0, 30); /* Martin Ettl, Nov 07 2012 */

(PARI) vector(16, n, my(m=n-1); prod(j=1, m, j*m+1)) \\ G. C. Greubel, Mar 04 2020

(MAGMA) [1] cat [&*[j*n+1: j in [1..n]]: n in [1..15]]; // G. C. Greubel, Mar 04 2020

(Sage) [product(j*n+1 for j in (1..n)) for n in (0..15)] # G. C. Greubel, Mar 04 2020

(GAP) List([0..15], n-> Product([1..n], j-> j*n+1) ); # G. C. Greubel, Mar 04 2020

CROSSREFS

Cf. A002522, A064808, A076110.

Sequence in context: A192567 A143886 A174482 * A087526 A283275 A264703

Adjacent sequences:  A076108 A076109 A076110 * A076112 A076113 A076114

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy, Oct 09 2002

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 20 2003

STATUS

approved

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 August 7 19:57 EDT 2020. Contains 336279 sequences. (Running on oeis4.)