Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130310
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130310 Minimal (or "greedy") Lucas representation of n. A binary system of integers with Lucas numbers (A000032) as a base. +0
4
10, 1, 100, 1000, 1010, 1001, 10000, 10010, 10001, 10100, 100000, 100010, 100001, 100100, 101000, 101010, 101001, 1000000, 1000010, 1000001, 1000100, 1001000, 1001010, 1001001, 1010000, 1010010, 1010001, 1010100, 10000000 (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 Powers of Phi to represent Integers.

EXAMPLE

a(9) = 10001 because 7+2=9, a(10) is 10100 because 7+3=10

CROSSREFS

Cf. A014417, A000032, A130311.

Adjacent sequences: A130307 A130308 A130309 this_sequence A130311 A130312 A130313

Sequence in context: A165293 A038303 A075505 this_sequence A051523 A048882 A156286

KEYWORD

nonn

AUTHOR

Casey Mongoven (cm(AT)caseymongoven.com), May 21 2007

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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research