|
Search: id:A094568
|
|
|
| A094568 |
|
Triangle of binary products of Fibonacci numbers. |
|
+0
4
|
|
| 2, 3, 5, 8, 10, 13, 21, 24, 26, 34, 55, 63, 65, 68, 89, 144, 165, 168, 170, 178, 233, 377, 432, 440, 442, 445, 466, 610, 987, 1131, 1152, 1155, 1157, 1165, 1220, 1597, 2584, 2961, 3016, 3024, 3026, 3029, 3050, 3194, 4181, 6765, 7752, 7896, 7917, 7920, 7922
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
In each row, the difference between neighboring terms is a Fibonacci number. For n>1, row n consists of n numbers, first F(2n) and last F(2n+1). Central numbers: (2,10,65,442,...), essentially A064170. Alternating row sums: 2,2,11,11,78,78,...; the sequence b=(2,11,78,...) is A094569.
|
|
REFERENCES
|
C. Kimberling, Orderings of Products of Fibonacci Numbers, Fibonacci Quart. 42 (2004), no. 1, 28-35.
|
|
FORMULA
|
Start with the triangle in A094566: starting with row 2, expel from each row the term that is a square of a Fibonacci number. The remaining triangle is A094567.
|
|
EXAMPLE
|
First four rows:
2
3 5
8 10 13
21 24 26 34
|
|
CROSSREFS
|
Cf. A000045, A094565, A094566, A094569.
Sequence in context: A112045 A098389 A004977 this_sequence A022955 A087279 A084907
Adjacent sequences: A094565 A094566 A094567 this_sequence A094569 A094570 A094571
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), May 12 2004
|
|
|
Search completed in 0.002 seconds
|
