[go: up one dir, main page]

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
1, 10, 129, 2516, 68405, 2391495, 102022809, 5130659560, 296881218693, 19415908147835, 1415538531617771, 113796709835547766, 9998149029974754103, 952980844872975079231, 97930011125976327934825 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A066382(n) - 1. - Peter Luschny, Mar 06 2020
MAPLE
seq( add(binomial(n^2, j), j=1..n), n=1..20); # G. C. Greubel, Mar 06 2020
MATHEMATICA
Table[Sum[Binomial[n^2, i], {i, n}], {n, 20}] (* Harvey P. Dale, Nov 03 2013 *)
PROG
(PARI) vector(20, n, sum(j=1, n, binomial(n^2, j))) \\ G. C. Greubel, Mar 06 2020
(Magma) [ &+[Binomial(n^2, j): j in [1..n]]: n in [1..20]]; // G. C. Greubel, Mar 06 2020
(Sage) [sum(binomial(n^2, j) for j in (1..n)) for n in (1..20)] # G. C. Greubel, Mar 06 2020
CROSSREFS
Cf. A066382.
Sequence in context: A183538 A184678 A360941 * A054050 A067313 A104130
KEYWORD
nonn,easy
AUTHOR
Joseph Lavinus Ganley (jwl8k(AT)server.cs.Virginia.EDU)
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 August 29 09:16 EDT 2024. Contains 375511 sequences. (Running on oeis4.)