Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127718
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127718 A007318 * A002260 as infinite lower triangular matrices; A002260 = [1; 1,2; 1,2,3,...]. +0
2
1, 2, 2, 4, 6, 3, 8, 14, 12, 4, 16, 30, 33, 20, 5, 32, 62, 78, 64, 30, 6, 64, 126, 171, 168, 110, 42, 7, 128, 254, 360, 396, 320, 174, 56, 8, 256, 510, 741, 876, 815, 558, 259, 72, 9, 512, 1022, 1506, 1864, 1910, 1536, 910, 368, 90, 10, 1024, 2046, 3039, 3872, 4240 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Binomial transform of A002260.

Row sums = A084851: (1, 4, 13, 38, 104, 272,...) A002260 * A007318 = A127717

FORMULA

T(n,k)=sum_{i=1..n} A007318(n-1,i-1)*A002260(i,k) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2007

EXAMPLE

First few rows of the triangle are:

1;

2, 2;

4, 6, 3;

8, 14, 12, 4;

16, 30, 33, 20, 5;

32, 62, 78, 64, 30, 6;

64, 126, 171, 168, 110, 42, 7;

...

MAPLE

A007318 := proc(n, k) binomial(n, k) ; end: A002260 := proc(n, k) if k <= n then k; else 0 ; fi ; end: A127718 := proc(n, k) add( A007318(n-1, i-1)*A002260(i, k), i=1..n) ; end: for n from 1 to 15 do for k from 1 to n do printf("%d, ", A127718(n, k)) ; od: od: - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2007

CROSSREFS

Cf. A002260, A007318, A084851, A127717.

Adjacent sequences: A127715 A127716 A127717 this_sequence A127719 A127720 A127721

Sequence in context: A010768 A143267 A113463 this_sequence A115068 A051495 A073256

KEYWORD

nonn,tabl,easy

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 25 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2007

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research