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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A008975 Pascal's triangle mod 10. 19
 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 0, 0, 5, 1, 1, 6, 5, 0, 5, 6, 1, 1, 7, 1, 5, 5, 1, 7, 1, 1, 8, 8, 6, 0, 6, 8, 8, 1, 1, 9, 6, 4, 6, 6, 4, 6, 9, 1, 1, 0, 5, 0, 0, 2, 0, 0, 5, 0, 1, 1, 1, 5, 5, 0, 2, 2, 0, 5, 5, 1, 1, 1, 2, 6, 0, 5, 2, 4, 2, 5, 0, 6, 2, 1, 1, 3, 8, 6, 5, 7, 6, 6 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Reinhard Zumkeller, Rows n=0..150 of triangle, flattened FORMULA T(i, j) = binomial(i, j) (mod 10) MATHEMATICA Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], 10] (* Robert G. Wilson v, May 26 2004 *) PROG (Haskell) a008975 n k = a008975_tabl !! n !! k a008975_row n = a008975_tabl !! n a008975_tabl = iterate    (\row -> map (`mod` 10) \$ zipWith (+) ([0] ++ row) (row ++ [0])) [1] -- Reinhard Zumkeller, Feb 24 2012 CROSSREFS Cf. A007318, A047999, A083093, A034931, A034930, A034932. Cf. A208278 (row sums), A208279 (central terms), A208134 (number of zeros per row), A208280 (distinct terms per row). Sequences based on the triangles formed by reading Pascal's triangle mod m: A047999 (m = 2), A083093 (m = 3), A034931 (m = 4), A095140 (m = 5), A095141 (m = 6), A095142 (m = 7), A034930 (m = 8), A095143 (m = 9), A008975 (m = 10), A095144 (m = 11), A095145 (m = 12), A275198 (m = 14), A034932 (m = 16). Sequence in context: A180181 A128629 A107065 * A140280 A140586 A095143 Adjacent sequences:  A008972 A008973 A008974 * A008976 A008977 A008978 KEYWORD nonn,tabl,base AUTHOR 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 March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)