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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A143200 Triangle read by rows: t(n,m) is -1 if binomial(n, m) is greater than 1 and odd, otherwise t(n,m) = binomial(n, m) mod 2. 1
1, 1, 1, 1, 0, 1, 1, -1, -1, 1, 1, 0, 0, 0, 1, 1, -1, 0, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, 1, -1, -1, -1, -1, -1, -1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, -1, 0, 0, 0, 0, 0, 0, -1, 1, 1, 0, -1, 0, 0, 0, 0, 0, -1, 0, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Row sums are: {1, 2, 2, 0, 2, 0, 0, -4, 2, 0, 0} (see A142242).

Similar to A047999 but with internal 1's replaced by -1's.

Suggested by A142463.

FORMULA

t(n,m)=If[Mod[Binomial[n, m], 2] == 1 && Binomial[n, m] > 1, -1, Mod[ Binomial[n, m], 2]].

EXAMPLE

{1},

{1, 1},

{1, 0, 1},

{1, -1, -1, 1},

{1, 0, 0, 0, 1},

{1, -1,0, 0, -1, 1},

{1, 0, -1, 0, -1, 0, 1},

{1, -1, -1, -1, -1, -1, -1, 1},

{1, 0, 0, 0, 0, 0, 0, 0, 1},

{1, -1, 0, 0, 0, 0, 0, 0, -1, 1},

{1, 0, -1, 0, 0, 0, 0, 0, -1, 0, 1}

MATHEMATICA

t[n_, m_] := If[Mod[Binomial[n, m], 2] == 1 && Binomial[n, m] > 1, -1, Mod[ Binomial[n, m], 2]]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]

CROSSREFS

Cf. A047999, A142463, A142242.

Sequence in context: A077009 A078556 A144093 * A166282 A047999 A054431

Adjacent sequences:  A143197 A143198 A143199 * A143201 A143202 A143203

KEYWORD

tabl,sign

AUTHOR

Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 20 2008

EXTENSIONS

Edited by N. J. A. Sloane, Aug 15 2009

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 14 23:44 EST 2012. Contains 205689 sequences.