|
|
A104762
|
|
Triangle read by rows: row n contains first n nonzero Fibonacci numbers in decreasing order.
|
|
10
|
|
|
1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 5, 3, 2, 1, 1, 8, 5, 3, 2, 1, 1, 13, 8, 5, 3, 2, 1, 1, 21, 13, 8, 5, 3, 2, 1, 1, 34, 21, 13, 8, 5, 3, 2, 1, 1, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 144, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 233, 144, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Sum of n-th row = F(n+2) - 1; sequence A000071 starting (1, 2, 4, 7, 12, 20, ...).
Sequence B is called a reverse reluctant sequence of sequence A, if B is triangle array read by rows: row number k lists first k elements of the sequence A in reverse order. Sequence A104762 is the reverse reluctant sequence of Fibonacci numbers (A000045), except 0. - Boris Putievskiy, Dec 13 2012
|
|
LINKS
|
|
|
FORMULA
|
In every column, (1, 1, 2, 3, 5, ...); the nonzero Fibonacci numbers, A000045.
a(n,k) = |round[(r^n)*(s^k)/sqrt(5)|, where r = golden ratio = (1+ sqrt(5))/2, s = (1 - sqrt(5))/2, 1 < = k <= n-1, n > = 2. - Clark Kimberling, May 01 2016
G.f. of triangle: G(x,y) = x*y/((1-x-x^2)*(1-x*y)). - Robert Israel, May 01 2016
|
|
EXAMPLE
|
First few rows of the triangle:
1;
1, 1;
2, 1, 1;
3, 2, 1, 1;
5, 3, 2, 1, 1;
8, 5, 3, 2, 1, 1;
...
Production matrix begins:
1, 1;
1, 0, 1;
0, 0, 0, 1;
0, 0, 0, 0, 1;
0, 0, 0, 0, 0, 1;
0, 0, 0, 0, 0, 0, 1;
0, 0, 0, 0, 0, 0, 0, 1;
... (End)
|
|
MAPLE
|
seq(seq(combinat:-fibonacci(n-i), i=0..n-1), n=1..20); # Robert Israel, May 01 2016
|
|
MATHEMATICA
|
r = N[(1 + Sqrt[5])/2, 100]; s = N[(1 - Sqrt[5])/2, 100];
t = Table[Abs[Round[(r^n)*(s^k)/Sqrt[5]]], {n, 2, 15}, {k, 1, n - 1}]
Flatten[t]
TableForm[t]
Table[Reverse[Fibonacci[Range[n]]], {n, 15}]//Flatten (* Harvey P. Dale, Jan 28 2019 *)
|
|
CROSSREFS
|
Companion triangle A104763, Fibonacci sequence in each row starting from the left. A121461.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|