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!)
A007819 a(n) = Sum_{j=1..n} binomial(n^2, j). 1

%I #15 Sep 08 2022 08:44:35

%S 1,10,129,2516,68405,2391495,102022809,5130659560,296881218693,

%T 19415908147835,1415538531617771,113796709835547766,

%U 9998149029974754103,952980844872975079231,97930011125976327934825

%N a(n) = Sum_{j=1..n} binomial(n^2, j).

%H Harvey P. Dale, <a href="/A007819/b007819.txt">Table of n, a(n) for n = 1..338</a>

%F a(n) = A066382(n) - 1. - _Peter Luschny_, Mar 06 2020

%p seq( add(binomial(n^2,j), j=1..n), n=1..20); # _G. C. Greubel_, Mar 06 2020

%t Table[Sum[Binomial[n^2,i],{i,n}],{n,20}] (* _Harvey P. Dale_, Nov 03 2013 *)

%o (PARI) vector(20, n, sum(j=1,n, binomial(n^2,j))) \\ _G. C. Greubel_, Mar 06 2020

%o (Magma) [ &+[Binomial(n^2,j): j in [1..n]]: n in [1..20]]; // _G. C. Greubel_, Mar 06 2020

%o (Sage) [sum(binomial(n^2,j) for j in (1..n)) for n in (1..20)] # _G. C. Greubel_, Mar 06 2020

%Y Cf. A066382.

%K nonn,easy

%O 1,2

%A Joseph Lavinus Ganley (jwl8k(AT)server.cs.Virginia.EDU)

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 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)