login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127625 Triangle T(n,k) = binomial(n-1,k-1)*A001511(k), 1<=k<=n, read by rows. 0
1, 1, 2, 1, 4, 1, 1, 6, 3, 3, 1, 8, 6, 12, 1, 1, 10, 10, 30, 5, 2, 1, 12, 15, 60, 15, 12, 1, 1, 14, 21, 105, 35, 42, 7, 4, 1, 16, 28, 168, 70, 112, 28, 32, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Column k of Pascal's triangle is multiplied by the k-th entry of the ruler sequence.
LINKS
FORMULA
T(n,n) = A001511(n).
EXAMPLE
First few rows of the triangle are:
1;
1, 2;
1, 4, 1;
1, 6, 3, 3;
1, 8, 6, 12, 1;
1, 10, 10, 30, 5, 2;
1, 12, 15, 60, 15, 12, 1;
...
CROSSREFS
Cf. A106461 (row sums), A001511.
Sequence in context: A191310 A124845 A191392 * A124844 A133934 A055327
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Jan 20 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)