Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130311
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130311 Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base. +0
5
10, 1, 11, 110, 1010, 111, 1011, 1110, 1101, 1111, 10110, 11010, 10111, 11011, 11110, 101010, 11111, 101011, 101110, 101101, 101111, 110110, 111010, 110111, 111011, 111110, 111101, 111111, 1010110 (list; graph; listen)
OFFSET

1,1

REFERENCES

Zeckendorf, E., 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, Using Fibonacci Numbers to Represent Whole Numbers.

EXAMPLE

a(7) = 1110 because 4+3+1 = 8, a(8) = 1101 because 4+3+2 = 9

CROSSREFS

Cf. A000032, A104326, A130310.

Sequence in context: A107353 A164899 A164844 this_sequence A063672 A070606 A073731

Adjacent sequences: A130308 A130309 A130310 this_sequence A130312 A130313 A130314

KEYWORD

nonn

AUTHOR

Casey Mongoven (cm(AT)caseymongoven.com), May 21 2007; corrected Mar 23 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research