Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124931
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124931 Triangle read by rows: T(n,k)=(2k-1)*binom(n,k) (1<=k<=n). +0
1
1, 2, 3, 3, 9, 5, 4, 18, 20, 7, 5, 30, 50, 35, 9, 6, 45, 100, 105, 54, 11, 7, 63, 175, 245, 189, 77, 13, 8, 84, 280, 490, 504, 308, 104, 15, 9, 108, 420, 882, 1134, 924, 468, 135, 17, 10, 135, 600, 1470, 2268, 2310, 1560, 675, 170, 19, 11, 165, 825, 2310, 4158, 5082, 4290 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Sum of entries in row n = 1+(n-1)*2^n = A000337(n).

EXAMPLE

First few rows of the triangle are:

1;

2, 3;

3, 9, 5;

4, 18, 20, 7;

5, 30, 50, 35, 9;

6, 45, 100, 105, 54, 11;

...

MAPLE

T:=(n, k)->(2*k-1)*binomial(n, k): for n from 1 to 12 do seq(T(n, k), k=1..n) od; # yields sequence in triangular form

CROSSREFS

Cf. A000337.

Sequence in context: A108692 A157126 A059083 this_sequence A124932 A110042 A123027

Adjacent sequences: A124928 A124929 A124930 this_sequence A124932 A124933 A124934

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 12 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 29 2006

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research