%I #5 May 10 2014 18:07:32
%S 1,1,1,1,2,1,1,3,3,1,1,4,6,4,1,1,5,1,1,5,1,1,6,6,2,6,6,1,1,7,3,8,8,3,
%T 7,1,1,8,1,2,7,2,1,8,1,1,9,9,3,9,9,3,9,9,1,1,1,9,3,3,9,3,3,9,1,1,1,2,
%U 1,3,6,3,3,6,3,1,2,1,1,3,3,4,9,9,6,9
%N Digital roots in Pascal's triangle, triangle read by rows, 0 <= k <= n.
%C T(n,k) = A010888(A007318(n,k)).
%H Reinhard Zumkeller, <a href="/A242312/b242312.txt">Rows n = 0..125 of table, flattened</a>
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F T(n,k) = A010888(A096145(n,k)).
%o (Haskell)
%o a242312 n k = a242312_tabl !! n !! k
%o a242312_row n = a242312_tabl !! n
%o a242312_tabl = map (map a010888) a007318_tabl
%Y Cf. A242314 (max per row).
%K nonn,tabl,base
%O 0,5
%A _Reinhard Zumkeller_, May 10 2014