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!)
A264409 a(n) = Sum_{k=0..n} binomial(n, k) * binomial((n-k)*k, k). 2

%I #10 Jan 10 2019 11:18:28

%S 1,1,3,10,53,376,3187,31312,348833,4318804,58583231,862021084,

%T 13650998473,231123405124,4160680867085,79272259679386,

%U 1592221255517713,33599025754872240,742661269363444447,17149370461633306924,412742027009797487561,10331628852664232678356,268469799828424474556585,7229580560131818394109850,201438863633591604857727001

%N a(n) = Sum_{k=0..n} binomial(n, k) * binomial((n-k)*k, k).

%H Seiichi Manyama, <a href="/A264409/b264409.txt">Table of n, a(n) for n = 0..468</a>

%e a(0) = 1;

%e a(1) = 1*C(0,0) + 1*C(0,1) = 1;

%e a(2) = 1*C(0,0) + 2*C(1,1) + 1*C(0,2) = 1 + 2*1 + 0 = 3;

%e a(3) = 1*C(0,0) + 3*C(2,1) + 3*C(2,2) + 1*C(0,3) = 1 + 3*2 + 3*1 + 0 = 10;

%e a(4) = 1*C(0,0) + 4*C(3,1) + 6*C(4,2) + 4*C(3,3) + 1*C(0,4) = 1 + 4*3 + 6*6 + 4 + 0 = 53; ...

%t Table[Sum[Binomial[n, k] * Binomial[(n-k)*k, k], {k,0,n}], {n,0,20}] (* _Vaclav Kotesovec_, Aug 22 2017 *)

%o (PARI) {a(n) = sum(k=0, n, binomial(n, k)*binomial((n-k)*k, k))}

%o for(n=0,30,print1(a(n),", "))

%K nonn

%O 0,3

%A _Paul D. Hanna_, Nov 18 2015

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 07:11 EDT 2024. Contains 371782 sequences. (Running on oeis4.)