login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A181630
Duplicate of A112310.
3
1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 4, 4, 4, 5
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, ...).
Is this the same as A112310? - R. J. Mathar, Nov 03 2010
Contribution from Gary W. Adamson, Nov 03 2010: (Start)
The next row of 13 terms = (3, 4, 4, 5, 6, 4, 4, 5, 4, 5, 5, 5, 6), sum = 58. (End)
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
Sequence in context: A128330 A133801 A372433 * A112310 A350240 A342739
KEYWORD
dead
AUTHOR
Gary W. Adamson, Nov 02 2010
STATUS
approved