Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141434
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141434 A triangular sequence of coefficient weights: k = -1; l = -1; t(n,m,k,l)=(m + l)*((2 - l)*n - m + k). (row sum corrected ). +0
1
0, 0, 3, 0, 6, 10, 0, 9, 16, 21, 0, 12, 22, 30, 36, 0, 15, 28, 39, 48, 55, 0, 18, 34, 48, 60, 70, 78, 0, 21, 40, 57, 72, 85, 96, 105, 0, 24, 46, 66, 84, 100, 114, 126, 136, 0, 27, 52, 75, 96, 115, 132, 147, 160, 171 (list; table; graph; listen)
OFFSET

1,3

COMMENT

Row sums are:

{0, 3, 16, 46, 100, 185, 308, 476, 696, 975}.

FORMULA

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

EXAMPLE

{0},

{0, 3},

{0, 6, 10},

{0, 9, 16, 21},

{0, 12, 22, 30, 36},

{0, 15, 28, 39, 48, 55},

{0, 18, 34, 48, 60, 70, 78},

{0, 21, 40, 57, 72, 85, 96, 105},

{0, 24, 46, 66, 84, 100, 114, 126, 136},

{0, 27, 52, 75, 96, 115, 132, 147, 160, 171}

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, k, l], {m, 1, n}], {n, 1, 10}]; TableForm[a];

CROSSREFS

Sequence in context: A016598 A119583 A011415 this_sequence A077911 A057381 A144091

Adjacent sequences: A141431 A141432 A141433 this_sequence A141435 A141436 A141437

KEYWORD

nonn,uned,tabl

AUTHOR

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

page 1

Search completed in 0.005 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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research