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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064406 The accumulation of the number of even entries (A048967) over the number of odd entries (A001316) in row n of Pascal's triangle (A007318). 0
-1, -3, -4, -8, -7, -9, -10, -18, -13, -11, -8, -12, -7, -9, -10, -26, -13, -3, 8, 12, 25, 31, 38, 30, 47, 57, 68, 64, 77, 75, 74, 42, 71, 97, 124, 144, 173, 195, 218, 226, 259, 285, 312, 324, 353, 367, 382, 366, 407, 441, 476, 496, 533, 555, 578, 570, 611, 637, 664, 660, 689, 687, 686, 622, 683, 741, 800, 852, 913, 967 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

Tony Colledge, "Pascal's Triangle, A teacher's guide with blackline masters," Tarquin Publications, Norfolk, England, Second Edition, 1997, page 9.

EXAMPLE

a(4) = -7 because in the zeroth row there is one odd entry (-1), in the first row there are two odd entries (-3), in the second row there are two odd and one even entry (-4), in the third row there four odd entries (-8) and in the fourth row there are two odd entries and three entries (-7).

MATHEMATICA

f[ n_ ] := n + 1 - 2Sum[ Mod[ Binomial[ n, k ], 2 ], {k, 0, n} ]; Table[ Sum[ f[ k ], {k, 0, n} ], {n, 0, 100} ]

CROSSREFS

Sequence in context: A081543 A105753 A019972 * A049826 A123323 A034772

Adjacent sequences:  A064403 A064404 A064405 * A064407 A064408 A064409

KEYWORD

easy,sign

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 29 2001

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 16 20:38 EST 2012. Contains 205962 sequences.