A242312 Digital roots in Pascal's triangle, triangle read by rows, 0 <= k <= n.

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, 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, 1, 3, 6, 3, 3, 6, 3, 1, 2, 1, 1, 3, 3, 4, 9, 9, 6, 9

Offset

0,5

Comments

T(n,k) = A010888(A007318(n,k)).

Links

Reinhard Zumkeller, Rows n = 0..125 of table, flattened

Index entries for triangles and arrays related to Pascal's triangle

Formula

T(n,k) = A010888(A096145(n,k)).

Prog

(Haskell)
a242312 n k = a242312_tabl !! n !! k
a242312_row n = a242312_tabl !! n
a242312_tabl = map (map a010888) a007318_tabl

Crossrefs

Cf. A242314 (max per row).

Sequence in context: A140586 A339379 A095143 * A140279 A096145 A306309

Adjacent sequences: A242309 A242310 A242311 * A242313 A242314 A242315

Keyword

nonn,tabl,base

Author

Reinhard Zumkeller, May 10 2014

Status

approved