A206425 Erroneous version of A227428.

0, 0, 1, 0, 0, 2, 1, 2, 4, 0, 0, 2, 0, 0, 4, 2, 4, 8, 1, 2, 4, 2, 4, 8, 1, 2, 4, 2, 4, 8, 4, 8, 13, 0, 0, 2, 0, 0, 4, 2, 4, 8, 0, 0, 4, 0, 0, 8, 4, 8, 16, 2, 4, 8, 4, 8, 16, 8, 16, 26, 1, 2, 4, 2, 4, 8, 4, 8, 13, 2, 4, 8, 4, 8, 16, 8, 16, 26, 4, 8, 13, 8, 16, 26

Offset: 0

Author

Marcus Jaiclin, Feb 07 2012

Keywords

• dead

Comments

A006047(n) = A206424(n) + a(n).

Examples

			Example: Rows 0-8 of Pascal's Triangle (mod 3) are:
1                   So a(0) = 0
1 1                 So a(1) = 0
1 2 1               So a(2) = 1
1 0 0 1                 .
1 1 0 1 1               .
1 2 1 1 2 1             .
1 0 0 2 0 0 1
1 1 0 2 2 0 1 1
1 2 1 2 1 2 1 2 1
		

Links

• Marcus Jaiclin, et al. Pascal's Triangle, Mod 2,3,5

Crossrefs

Cf. A083093, A062296, A006047.

Programs

Mathematica

Table[Count[Mod[Binomial[n, Range[0, n]], 3], 2], {n, 0, 99}] (* Alonso del Arte, Feb 07 2012 *)