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!)
A076111 Product of terms in n-th row of A076110. 3

%I #17 Mar 30 2023 12:42:33

%S 1,2,15,280,9945,576576,49579075,5925744000,939536222625,

%T 190787784140800,48279601331512551,14894665739501184000,

%U 5502449072258318805625,2397950328737212204032000

%N Product of terms in n-th row of A076110.

%H G. C. Greubel, <a href="/A076111/b076111.txt">Table of n, a(n) for n = 0..230</a>

%F a(n) = Prod_{k=1..n} (1+n*k). - _Yalcin Aktar_, Jul 14 2009

%F a(n) = n^n * Pochhammer(n, 1 + 1/n). - _G. C. Greubel_, Mar 04 2020

%F a(n) = A092985(n)*(n^2+1). - _R. J. Mathar_, Mar 30 2023

%p seq( mul(j*n+1, j=1..n), n=0..15); # _G. C. Greubel_, Mar 04 2020

%t Table[Product[j*n+1, {j,n}], {n,0,15}] (* _G. C. Greubel_, Mar 04 2020 *)

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

%o makelist(A076111(n),n,0,30); /* _Martin Ettl_, Nov 07 2012 */

%o (PARI) vector(16, n, my(m=n-1); prod(j=1,m, j*m+1)) \\ _G. C. Greubel_, Mar 04 2020

%o (Magma) [1] cat [&*[j*n+1: j in [1..n]]: n in [1..15]]; // _G. C. Greubel_, Mar 04 2020

%o (Sage) [product(j*n+1 for j in (1..n)) for n in (0..15)] # _G. C. Greubel_, Mar 04 2020

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

%Y Cf. A002522, A064808, A076110.

%K easy,nonn

%O 0,2

%A _Amarnath Murthy_, Oct 09 2002

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

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 March 29 05:28 EDT 2024. Contains 371264 sequences. (Running on oeis4.)