login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181630 Duplicate of A112310. 3
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, ...).
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)
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
Sequence in context: A368869 A128330 A133801 * A112310 A350240 A342739
KEYWORD
dead
AUTHOR
Gary W. Adamson, Nov 02 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 05:35 EST 2024. Contains 370267 sequences. (Running on oeis4.)