login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094441 Triangular array T(n,k)=F(n+1-k)C(n,k), k=0,1,2,...,n; n>=0. 7
1, 1, 1, 2, 2, 1, 3, 6, 3, 1, 5, 12, 12, 4, 1, 8, 25, 30, 20, 5, 1, 13, 48, 75, 60, 30, 6, 1, 21, 91, 168, 175, 105, 42, 7, 1, 34, 168, 364, 448, 350, 168, 56, 8, 1, 55, 306, 756, 1092, 1008, 630, 252, 72, 9, 1, 89, 550, 1530, 2520, 2730, 2016, 1050, 360, 90, 10, 1, 144 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

Sum_{k, 0<=k<=n} T(n,k)*x^k = A039834(n-1), A000045(n+1), A001519(n+1), A081567(n), A081568(n), A081569(n), A081570(n), A081571(n) for x = -1, 0, 1, 2, 3, 4, 5, 6 respectively . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 14 2009]

EXAMPLE

First four rows:

1

1 1

2 2 1

3 6 3 1

CROSSREFS

Cf. A094435, A000045.

Sequence in context: A124842 A134399 A094436 * A107230 A159830 A046726

Adjacent sequences:  A094438 A094439 A094440 * A094442 A094443 A094444

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:30 EST 2012. Contains 205678 sequences.