%I A046854
%S A046854 1,1,1,1,1,1,1,2,1,1,1,2,3,1,1,1,3,3,4,1,1,1,3,6,4,5,1,1,1,4,6,10,5,
%T A046854 6,1,1,1,4,10,10,15,6,7,1,1,1,5,10,20,15,21,7,8,1,1,1,5,15,20,35,21,
%U A046854 28,8,9,1,1,1,6,15,35,35,56,28,36,9,10,1,1,1,6,21,35,70,56,84,36,45
%N A046854 Triangle in which k-th entry of row n is binomial[ Floor[n/2 + k/2], 
               k].
%C A046854 Row sums are F(n+2). Diagonal sums are A016116. - Paul Barry (pbarry(AT)wit.ie), 
               Jul 07 2004
%C A046854 Riordan array (1/(1-x), x/(1-x^2)). Matrix inverse is A106180. - Paul 
               Barry (pbarry(AT)wit.ie), Apr 24 2005
%C A046854 As an infinite lower triangular matrix * [1,2,3,...] = A055244: (1, 1, 
               3, 6, 12, 23,...). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), 
               Dec 23 2008]
%F A046854 G.f.: (1+x) / (1-xy-x^2). - Ralf Stephan, Feb 13 2005
%F A046854 Triangle = A097806 * A049310, as infinite lower triangular matrices. 
               - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 28 2007
%e A046854 {1}, {1, 1}, {1, 1, 1}, {1, 2, 1, 1}, {1, 2, 3, 1, 1}, ...
%t A046854 Table[ Binomial[ Floor[ n/2 +k/2 ], k ], {n, 0, 16}, {k, 0, n} ]
%Y A046854 Reflected version of A065941, which is considered the main entry. Probably 
               a signed version is A066170. A deficient version is in A030111.
%Y A046854 Cf. A066170.
%Y A046854 Cf. A097806, A049310.
%Y A046854 A055244 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 23 2008]
%Y A046854 Sequence in context: A096670 A130461 A130777 this_sequence A066170 A071773 
               A000188
%Y A046854 Adjacent sequences: A046851 A046852 A046853 this_sequence A046855 A046856 
               A046857
%K A046854 nonn,tabl,easy
%O A046854 0,8
%A A046854 Wouter Meeussen (wouter.meeussen(AT)pandora.be)