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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094435 Triangular array read by rows: T(n,k)=F(k)C(n,k), k=1,2,3,...,n; n>=1. 4
1, 2, 1, 3, 3, 2, 4, 6, 8, 3, 5, 10, 20, 15, 5, 6, 15, 40, 45, 30, 8, 7, 21, 70, 105, 105, 56, 13, 8, 28, 112, 210, 280, 224, 104, 21, 9, 36, 168, 378, 630, 672, 468, 189, 34, 10, 45, 240, 630, 1260, 1680, 1560, 945, 340, 55, 11, 55, 330, 990, 2310, 3696, 4290, 3465, 1870 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Let F(n) denote the n-th Fibonacci number (A000045). Then n-th row sum of T is F(2n) and n-th alternating row sum is F(n).

LINKS

Table of n, a(n) for n=1..64.

EXAMPLE

First four rows:

1

2 1

3 3 2

4 6 8 3 sum = 4+6+8+3=21=F(8); alt.sum = 4-6+8-3=3=F(4).

T(4,3)=F(3)C(4,3)=2*4=8.

CROSSREFS

Cf. A094441, A000045.

Sequence in context: A006642 A324751 A210595 * A133341 A111492 A319254

Adjacent sequences:  A094432 A094433 A094434 * A094436 A094437 A094438

KEYWORD

nonn,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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 00:10 EDT 2019. Contains 327990 sequences. (Running on oeis4.)