The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242312 Digital roots in Pascal's triangle, triangle read by rows, 0 <= k <= n. 3
 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS T(n,k) = A010888(A007318(n,k)). LINKS Reinhard Zumkeller, Rows n = 0..125 of table, flattened 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: A140280 A140586 A095143 * A140279 A096145 A306309 Adjacent sequences:  A242309 A242310 A242311 * A242313 A242314 A242315 KEYWORD nonn,tabl,base AUTHOR Reinhard Zumkeller, May 10 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 13:55 EST 2020. Contains 331010 sequences. (Running on oeis4.)