login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008975 Pascal's triangle mod 10. 12
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; internal format)
OFFSET

0,5

FORMULA

T(i, j) = binomial(i, j) (mod 10)

MATHEMATICA

Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], 10] (from Robert G. Wilson v May 26 2004)

CROSSREFS

Cf. A007318, A047999, A083093, A034931, A034930, A034932.

Sequence in context: A180181 A128629 A107065 * A140280 A140586 A095143

Adjacent sequences:  A008972 A008973 A008974 * A008976 A008977 A008978

KEYWORD

nonn,tabl,base

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.