OFFSET
1,1
COMMENTS
Start with the triangle in A094566: starting with row 2, expel from each row the term that is a square of a Fibonacci number (A007598). The remaining triangle is this sequence.
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.
LINKS
Clark Kimberling, Orderings of products of Fibonacci numbers, Fibonacci Quarterly 42:1 (2004), pp. 28-35.
EXAMPLE
First four rows:
2
3 5
8 10 13
21 24 26 34
PROG
(PARI) pef(k, n) = fibonacci(2*k)*fibonacci(2*n-2*k);
pof(k, n) = fibonacci(2*n-2*k+1)*fibonacci(2*k-1);
isfib(n) = my(k=n^2); k+=(k+1)<<2; issquare(k) || (n>0 && issquare(k-8)); \\ from A010056
isfib2(x) = issquare(x) && isfib(sqrtint(x));
tabl(nn) = {for (n=2, nn, if (n % 2 == 0, for (k=1, n/2, if (! isfib2(x = pef(k, n)), print1(x, ", ")); ); forstep (k=n/2, 1, -1, if (! isfib2(x = pof(k, n)), print1(x, ", ")); ), for (k=1, n\2, if (! isfib2(x = pef(k, n)), print1(x, ", ")); ); forstep (k=n\2+1, 1, -1, if (! isfib2(x = pof(k, n)), print1(x, ", ")); ); ); print(); ); } \\ Michel Marcus, May 04 2016
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, May 12 2004
STATUS
approved