login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306463 a(n) = Sum_{k=0..n} Sum_{m=0..floor(k/2)} binomial(k-m, m)*binomial(n-k, k-m)^2. 2

%I #24 Jan 30 2020 21:29:18

%S 1,1,2,6,15,37,98,262,699,1883,5110,13918,38045,104355,287028,791320,

%T 2186209,6051113,16776022,46577806,129491865,360432855,1004332322,

%U 2801307498,7820572153,21851390549,61101872126,170977916730,478755116117,1341389394715,3760507521800

%N a(n) = Sum_{k=0..n} Sum_{m=0..floor(k/2)} binomial(k-m, m)*binomial(n-k, k-m)^2.

%H Seiichi Manyama, <a href="/A306463/b306463.txt">Table of n, a(n) for n = 0..2202</a>

%F G.f.: 1/sqrt(x^6 + 2*x^5 - x^4 - 4*x^3 - x^2 - 2*x + 1).

%F D-finite with recurrence: n*a(n) +(-2*n+1)*a(n-1) +(-n+1)*a(n-2) +2*(-2*n+3)*a(n-3) +(-n+2)*a(n-4) +(2*n-5)*a(n-5) +(n-3)*a(n-6)=0. - _R. J. Mathar_, Jan 16 2020

%o (Maxima)

%o a(n):=sum(sum(binomial(k-m,m)*binomial(n-k,k-m)^2,m,0,k/2),k,0,n);

%o (PARI) a(n) = sum(k=0, n, sum(m=0, k\2, binomial(k-m, m)*binomial(n-k, k-m)^2)); \\ _Michel Marcus_, Feb 18 2019

%o (PARI) N=66; x='x+O('x^N); Vec(1/sqrt(x^6+2*x^5-x^4-4*x^3-x^2-2*x+1)) \\ _Seiichi Manyama_, Feb 20 2019

%Y Cf. A008459, A306504.

%K nonn

%O 0,3

%A _Vladimir Kruchinin_, Feb 17 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 23:40 EDT 2024. Contains 376002 sequences. (Running on oeis4.)