



1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 4, 4, 4, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,3


COMMENTS

A181631 = number of leading 1's in Fibonacci Maximal notation.
This notation uses headings: (...5, 3, 2, 1); and fills in entries starting from the right, as opposed to the left. For example n=8 = 1011 = (5 + 2 + 1) as opposed to Minimal notation which would be (1100) = (5 + 3).
Conjectured row sums = A023610: (1, 3, 7, 15, 30, 58, ...).
The next row of 13 terms = (3, 4, 4, 5, 6, 4, 4, 5, 4, 5, 5, 5, 6), sum = 58. (End)


LINKS



FORMULA

Count numbers of 1's in Fibonacci Maximal notation for n.


EXAMPLE

First few terms of the triangle:
1;
1, 2;
2, 2, 3;
2, 3, 3, 3, 4;
3, 3, 4, 3, 4, 4, 4, 5;
...
Example: 10 in Fibonacci Maximal = 1110, having three 1's, so a(10) = 3.


CROSSREFS



KEYWORD

dead


AUTHOR



STATUS

approved



