id:A008975 - OEIS Search Results

Search: id:A008975

Displaying 1-1 of 1 results found.

page 1

Pascal's triangle mod 10.

+0
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; listen)

	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.` `Adjacent sequences: A008972 A008973 A008974 this_sequence A008976 A008977 A008978` `Sequence in context: A055216 A128629 A107065 this_sequence A095143 A096145 A123264`
	KEYWORD	`nonn,tabl`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 22 15:55 EDT 2008. Contains 140006 sequences.

AT&T Labs Research