login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206425 Erroneous version of A227428. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
A006047(n) = A206424(n) + a(n).
LINKS
Marcus Jaiclin, et al. Pascal's Triangle, Mod 2,3,5
EXAMPLE
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
MATHEMATICA
Table[Count[Mod[Binomial[n, Range[0, n]], 3], 2], {n, 0, 99}] (* Alonso del Arte, Feb 07 2012 *)
CROSSREFS
Sequence in context: A350026 A118888 A061678 * A227428 A265255 A131022
KEYWORD
dead
AUTHOR
Marcus Jaiclin, Feb 07 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)