This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094438 Triangular array T(n,k)=F(k+3)C(n,k), k=0,1,2,3,...,n; n>=0. 2
 2, 2, 3, 2, 6, 5, 2, 9, 15, 8, 2, 12, 30, 32, 13, 2, 15, 50, 80, 65, 21, 2, 18, 75, 160, 195, 126, 34, 2, 21, 105, 280, 455, 441, 238, 55, 2, 24, 140, 448, 910, 1176, 952, 440, 89, 2, 27, 180, 672, 1638, 2646, 2856, 1980, 801, 144, 2, 30, 225, 960, 2730, 5292, 7140 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n+3) and n-th alternating row sum is F(n-3). LINKS EXAMPLE First four rows: 2 2 3 2 6 5 2 9 15 8 sum = 2+9+15+8=34=F(9); alt.sum = 2-9+15-8=0=-F(0). T(3,2)=F(5)C(3,2)=5*3=15. MATHEMATICA Table[Fibonacci[k+3]Binomial[n, k], {n, 0, 10}, {k, 0, n}]//Flatten (* Harvey P. Dale, Dec 16 2017 *) CROSSREFS Cf. A000045, A094443, A094436, A094437. Sequence in context: A290309 A095757 A144368 * A156098 A294933 A015996 Adjacent sequences:  A094435 A094436 A094437 * A094439 A094440 A094441 KEYWORD nonn,easy,tabl AUTHOR Clark Kimberling, May 03 2004 STATUS approved

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

Last modified October 19 16:17 EDT 2019. Contains 328223 sequences. (Running on oeis4.)