# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a163772 Showing 1-1 of 1 %I A163772 #18 Aug 05 2024 09:56:47 %S A163772 1,5,6,19,24,30,67,86,110,140,227,294,380,490,630,751,978,1272,1652, %T A163772 2142,2772,2445,3196,4174,5446,7098,9240,12012,7869,10314,13510,17684, %U A163772 23130,30228,39468,51480 %N A163772 Triangle interpolating the swinging factorial (A056040) restricted to odd indices with its binomial inverse. %C A163772 Triangle read by rows. For n >= 0, k >= 0 let %C A163772 T(n,k) = Sum_{i=k..n} (-1)^(n-i)*binomial(n-k,n-i)*(2i+1)$ where i$ denotes the swinging factorial of i (A056040). %H A163772 G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened %H A163772 Peter Luschny, Die schwingende Fakultät und Orbitalsysteme, August 2011. %H A163772 Peter Luschny, Swinging Factorial. %H A163772 M. Z. Spivey and L. L. Steil, The k-Binomial Transforms and the Hankel Transform, J. Integ. Seqs. Vol. 9 (2006), #06.1.1. %e A163772 1 %e A163772 5, 6 %e A163772 19, 24, 30 %e A163772 67, 86, 110, 140 %e A163772 227, 294, 380, 490, 630 %e A163772 751, 978, 1272, 1652, 2142, 2772 %e A163772 2445, 3196, 4174, 5446, 7098, 9240, 12012 %p A163772 For the functions 'DiffTria' and 'swing' see A163770. Computes n rows of the triangle. %p A163772 a := n -> DiffTria(k->swing(2*k+1),n,true); %t A163772 sf[n_] := n!/Quotient[n, 2]!^2; t[n_, k_] := Sum[ (-1)^(n-i)*Binomial[n-k, n-i]*sf[2*i+1], {i, k, n}]; Table[t[n, k], {n, 0, 7}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Jun 28 2013 *) %Y A163772 Row sums are A163775. Cf. A056040, A163650, A163771, A163772, A002426, A000984. %K A163772 nonn,tabl %O A163772 0,2 %A A163772 _Peter Luschny_, Aug 05 2009 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE