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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094565 Triangle read by rows: binary products of Fibonacci numbers. 2
1, 2, 3, 5, 6, 8, 13, 15, 16, 21, 34, 39, 40, 42, 55, 89, 102, 104, 105, 110, 144, 233, 267, 272, 273, 275, 288, 377, 610, 699, 712, 714, 715, 720, 754, 987, 1597, 1830, 1864, 1869, 1870, 1872, 1885, 1974, 2584, 4181, 4791, 4880, 4893, 4895, 4896, 4901, 4935 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Row n consists of n numbers, first F(2n-1) and last F(2n). Central numbers: (1,6,40,273,...)=A081016 Row sums: A001870 Alternating row sums: 1,1,7,7,48,48,329,329; the sequence b=(1,7,48,329,...) is A004187, given by b(n)=F(4n+2)-b(n-1) for n>=2, with b(1)=1.

In each row, the difference between neighboring terms is a Fibonacci number.

REFERENCES

C. Kimberling, Orderings of Products of Fibonacci Numbers, Fibonacci Quart. 42 (2004), no. 1, 28-35.

FORMULA

Row n: F(2)F(2n-1), F(4)F(2n-3), ..., F(2n)F(1)

EXAMPLE

Rows 1 to 4:

1

2 3

5 6 8

13 15 16 21

CROSSREFS

Cf. A000045, A094566, A094568.

Sequence in context: A125559 A087360 A111501 * A034722 A144712 A050028

Adjacent sequences:  A094562 A094563 A094564 * A094566 A094567 A094568

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), May 12 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 17 04:43 EST 2012. Contains 205981 sequences.