|
| |
|
|
A102364
|
|
Number of terms in Fibonacci sequence less than n not used in Zeckendorf representation of n (the Zeckendorf representation of n is a sum of non-consecutive distinct Fibonacci numbers).
|
|
3
| |
|
|
0, 0, 1, 2, 1, 3, 2, 2, 4, 3, 3, 3, 2, 5, 4, 4, 4, 3, 4, 3, 3, 6, 5, 5, 5, 4, 5, 4, 4, 5, 4, 4, 4, 3, 7, 6, 6, 6, 5, 6, 5, 5, 6, 5, 5, 5, 4, 6, 5, 5, 5, 4, 5, 4, 4, 8, 7, 7, 7, 6, 7, 6, 6, 7, 6, 6, 6, 5, 7, 6, 6, 6, 5, 6, 5, 5, 7, 6, 6, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| Number of 0's in Zeckendorf-binary representation of n. For example, the Zeckendorf representation of 12 is 8+3+1, which is 10101 in binary notation.
|
|
|
REFERENCES
| E. Zeckendorf, Representation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liege 41, 179-182, 1972.
|
|
|
LINKS
| Ron Knott, General Fibonacci Series
|
|
|
CROSSREFS
| Cf. A007895, A072649.
Sequence in context: A126792 A097367 A130211 * A132923 A144329 A141157
Adjacent sequences: A102361 A102362 A102363 * A102365 A102366 A102367
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Casey Mongoven (cm(AT)caseymongoven.com), Feb 22 2005
|
| |
|
|
