

A119789


Fibonacci Logarithms used to get a triangular array.


0



0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 4, 3, 3, 3, 4, 5, 6, 4, 4, 4, 5, 6, 7, 8, 5, 5, 5, 6, 7, 8, 9, 10, 6, 6, 6, 7, 8, 9, 10, 11, 12, 7, 7, 7, 8, 9, 10, 11, 12, 13, 14, 8, 8, 8, 9, 10, 11, 12, 13, 14, 15, 16
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,10


COMMENTS

Sequence suggested by Fibonacci multiplication.


LINKS

Table of n, a(n) for n=0..65.


FORMULA

Definition of Fibonacci logarithm such that after Fibonacci[1],f[n]+2>n: f[n_] = If[n == 0, 0, Floor[Log[Fibonacci[n]]/Log[GoldenRatio]]] a(n) = f[n]+f[m].


EXAMPLE

0
0, 0
0, 0, 0
1, 1, 1, 2
2, 2, 2, 3, 4
3, 3, 3, 4, 5, 6


MATHEMATICA

f[n_] = If[n == 0, 0, Floor[Log[Fibonacci[n]]/Log[GoldenRatio]]] b = Table[Table[f[n] + f[m], {n, 0, m}], {m, 0, 10}] MatrixForm[b]


CROSSREFS

Cf. A035517, A000045.
Sequence in context: A322789 A069904 A164978 * A025424 A216505 A265626
Adjacent sequences: A119786 A119787 A119788 * A119790 A119791 A119792


KEYWORD

nonn,uned,tabl


AUTHOR

Roger L. Bagula, Jul 30 2006


STATUS

approved



