|
%I #11 Jan 24 2018 01:03:27
%S 1,1,1,1,1,1,1,2,1,1,1,3,3,1,1,1,4,6,4,2,1,1,5,10,10,4,1,1,1,6,15,20,
%T 14,4,2,1,1,7,21,35,34,18,4,3,1,1,8,28,56,69,52,22,4,4,1,1,9,36,84,
%U 125,121,74,26,8,5,1,1,10,45,120,209,246,195,100
%N Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x/4 unless x=0 or x=h.
%H M. Janjic and B. Petkovic, <a href="http://arxiv.org/abs/1301.4550">A Counting Function</a>, arXiv preprint arXiv:1301.4550, 2013. - From N. J. A. Sloane, Feb 13 2013
%H M. Janjic, B. Petkovic, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL17/Janjic/janjic45.html">A Counting Function Generalizing Binomial Coefficients and Some Other Classes of Integers</a>, J. Int. Seq. 17 (2014) # 14.3.5
%e Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,2,1,1}; ...
%K nonn,tabl
%O 0,8
%A _Clark Kimberling_
|
