|
%I #15 Mar 01 2019 23:32:03
%S 1,1,2,1,1,3,1,1,2,4,1,1,1,2,5,1,1,1,2,3,6,1,1,1,1,2,3,7,1,1,1,1,2,2,
%T 4,8,1,1,1,1,1,2,3,4,9,1,1,1,1,1,2,2,3,5,10,1,1,1,1,1,1,2,2,3,5,11,1,
%U 1,1,1,1,1,2,2,3,4,6,12
%N Triangle of numbers floor(n/(n-k)).
%H Alois P. Heinz, <a href="/A010783/b010783.txt">Table of n, a(n) for n = 1..10011</a>
%p T:= (n,k)-> floor(n/(n-k)):
%p seq (seq (T(n, k), k=0..n-1), n=1..15); # _Alois P. Heinz_, Jul 15 2011
%o (Haskell)
%o a010783 n k = (n + 1 - k) `div` k
%o a010783_row n = a010783_tabl !! (n-1)
%o a010783_tabl = map reverse a010766_tabl
%o -- _Reinhard Zumkeller_, Apr 29 2015
%Y Cf. A010766 (mirrored).
%K nonn,tabl
%O 1,3
%A _N. J. A. Sloane_
|
