|
%I #13 Sep 08 2015 02:24:47
%S 1,1,1,0,2,1,0,2,3,1,0,2,5,4,1,0,0,7,9,5,1,0,0,7,16,14,6,1,0,0,7,23,
%T 30,20,7,1,0,0,7,30,53,50,27,8,1,0,0,7,37,83,103,77,35,9,1,0,0,0,44,
%U 120,186,180,112,44,10,1,0,0,0,44,164,306,366,292,156,54,11,1
%N Triangle read by rows: T(n,k) (1 <= k <= n+1) = number of sequences of length n, dominated by the squares, with entries from [0,k] and largest entry k.
%C A242105 gives the first nonzero terms per row, without repetitions. - _Reinhard Zumkeller_, Sep 06 2015
%H Reinhard Zumkeller, <a href="/A261897/b261897.txt">Rows n = 0..125 of triangle, flattened</a>
%H L. Haddad and C. Helou, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Helou/helou7.html">Finite Sequences Dominated by the Squares</a>, Journal of Integer Sequences, Volume 18, 2015, Issue 1, Article 15.1.8.
%e Triangle begins:
%e 1,
%e 1,1,
%e 0,2,1,
%e 0,2,3,1,
%e 0,2,5,4,1,
%e 0,0,7,9,5,1,
%e 0,0,7,16,14,6,1,
%e 0,0,7,23,30,20,7,1,
%e 0,0,7,30,53,50,27,8,1,
%e 0,0,7,37,83,103,77,35,9,1,
%e 0,0,0,44,120,186,180,112,44,10,1,
%e 0,0,0,44,164,306,366,292,156,54,11,1,
%e ...
%o (Haskell)
%o a261897 n k = a261897_tabl !! n !! (k-1)
%o a261897_row n = a261897_tabl !! n
%o a261897_tabl = [1] : f 1 0 [1] where
%o f t h xs | t <= (h + 1) ^ 2 = ys : f (t + 1) h ys
%o | otherwise = ys' : f (t + 1) (h + 1) ys'
%o where ys = zipWith (+) ([0] ++ xs) (xs ++ [0])
%o ys' = zipWith (+) ([0] ++ xs) (us ++ (0:vs) ++ [0])
%o (us, _:vs) = splitAt h xs
%o -- _Reinhard Zumkeller_, Sep 06 2015
%Y Cf. A242105, A261930 (row sums).
%K nonn,tabl
%O 0,5
%A _N. J. A. Sloane_, Sep 05 2015
|
