A035515 Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Little-endian concatenation of decimals.

0, 1, 2, 3, 13, 5, 15, 25, 8, 18, 28, 38, 138, 13, 113, 213, 313, 1313, 513, 1513, 2513, 21, 121, 221, 321, 1321, 521, 1521, 2521, 821, 1821, 2821, 3821, 13821, 34, 134, 234, 334, 1334, 534, 1534, 2534, 834, 1834, 2834, 3834, 13834, 1334, 11334, 21334

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy
• base

Examples

			16 = 13 + 3, so a(16)=3_13 => 313.
		

References

• Zeckendorf, E., Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège 41, 179-182, 1972.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
• N. J. A. Sloane, Classic Sequences

Crossrefs

Cf. A035517, A035514, A035516.

Programs

Haskell

a035515 n = a035515_list !! (n-1)
a035515_list = map (read . concatMap show) a035517_tabf :: [Integer]
-- Reinhard Zumkeller, Mar 10 2013

Extensions

More terms from James Sellers, Dec 13 1999