Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141432
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141432 A triangular sequence of coefficient weights: k = -1; l = 1; t(n,m,k,l)=(m + l)*((2 - l)*n - m + k). +0
1
-2, 0, -3, 2, 0, -4, 4, 3, 0, -5, 6, 6, 4, 0, -6, 8, 9, 8, 5, 0, -7, 10, 12, 12, 10, 6, 0, -8, 12, 15, 16, 15, 12, 7, 0, -9, 14, 18, 20, 20, 18, 14, 8, 0, -10, 16, 21, 24, 25, 24, 21, 16, 9, 0, -11 (list; table; graph; listen)
OFFSET

1,1

COMMENT

Row sums are: {-2, -3, -2, 2, 10, 23, 42, 68, 102, 145, ...}.

FORMULA

k = -1; l = 1; t(n,m,k,l)=(m + l)*((2 - l)*n - m + k).

EXAMPLE

{-2},

{0, -3},

{2, 0, -4},

{4, 3, 0, -5},

{6, 6, 4, 0, -6},

{8, 9, 8, 5,0, -7},

{10, 12, 12, 10, 6, 0, -8},

{12, 15, 16, 15, 12, 7, 0, -9},

{14, 18, 20, 20, 18, 14, 8, 0, -10},

{16, 21, 24, 25, 24, 21, 16, 9, 0, -11}

MATHEMATICA

Clear[T, n, m, a, l, k] T[n_, m_, k_, l_] = (m + l)*((2 - l)*n - m + k); k = -1; l = 1; a = Table[Table[T[n, m, k, l], {m, 1, n}], {n, 1, 10}]; Flatten[a] Table[Sum[T[n, m, 1, 1], {m, 1, n}], {n, 1, 10}]; TableForm[a];

CROSSREFS

Sequence in context: A035159 A103489 A127479 this_sequence A115241 A154559 A143324

Adjacent sequences: A141429 A141430 A141431 this_sequence A141433 A141434 A141435

KEYWORD

uned,tabl,sign

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research