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!)
A113408 Riordan array (1/(1-x^2-x^4*c(x^4)),x*c(x^2)), c(x) the g.f. of A000108. 2

%I #6 Mar 10 2017 03:01:20

%S 1,0,1,1,0,1,0,2,0,1,2,0,3,0,1,0,6,0,4,0,1,3,0,12,0,5,0,1,0,12,0,20,0,

%T 6,0,1,6,0,30,0,30,0,7,0,1,0,30,0,60,0,42,0,8,0,1,10,0,90,0,105,0,56,

%U 0,9,0,1,0,60,0,210,0,168,0,72,0,10,0,1,20,0,210,0,420,0,252,0,90,0,11,0,1

%N Riordan array (1/(1-x^2-x^4*c(x^4)),x*c(x^2)), c(x) the g.f. of A000108.

%C Row sums are A113409. Diagonal sums are A005773(n+1) with interpolated zeros.

%H G. C. Greubel, <a href="/A113408/b113408.txt">Table of n, a(n) for the first 50 rows, flattened</a>

%F T(n, k) = C((n+k)/2,k)*C(floor((n-k)/2),floor((n-k)/4))(1+(-1)^(n-k))/2.

%e Triangle begins

%e 1;

%e 0,1;

%e 1,0,1;

%e 0,2,0,1;

%e 2,0,3,0,1;

%e 0,6,0,4,0,1;

%e 3,0,12,0,5,0,1;

%t Table[Binomial[(n + k)/2, k]*Binomial[Floor[(n - k)/2], Floor[(n - k)/4]]*(1 + (-1)^(n - k))/2, {n, 0, 49}, {k, 0, n}] // Flatten (* _G. C. Greubel_, Mar 09 2017 *)

%o (PARI) for(n=0,25, for(k=0,n, print1( binomial((n+k)/2,k) *binomial(floor((n-k)/2),floor((n-k)/4))*(1+(-1)^(n-k))/2, ", "))) \\ _G. C. Greubel_, Mar 09 2017

%K easy,nonn,tabl

%O 0,8

%A _Paul Barry_, Oct 28 2005

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 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)