%I A116543
%S A116543 1,1,1,1,2,2,1,2,2,2,1,2,2,2,2,3,3,1,2,2,2,2,3,3,2,3,3,3,1,2,2,2,2,3,3,
%T A116543 2,3,3,3,2,3,3,3,3,4,4,1,2,2,2,2,3,3,2,3,3,3,2,3,3,3,3,4,4,2,3,3,3,3,4,
%U A116543 4,3,4,4,4,1,2,2,2,2,3,3,2,3,3,3,2,3,3,3,3,4,4,2,3,3,3,3,4,4,3,4,4,4,2
%N A116543 Number of terms in greedy representation of n of the Lucas numbers.
%C A116543 I have been researching A007895 and similar sequences and created this 
               sequence as an analogue of A007895 for the Lucas sequence (A000032).
%H A116543 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
               fibrep.html">Using the Fibonacci numbers to represent whole numbers</
               a>.
%F A116543 Let L(N)=max(Lucas numbers < N). Then a(0)=0 a(N)=1+a(N-L(N)).
%e A116543 a(12)=2 because 12=11+1
%Y A116543 Cf. A131343, A000032, A007895.
%Y A116543 Sequence in context: A105697 A080757 A037196 this_sequence A107260 A168258 
               A116204
%Y A116543 Adjacent sequences: A116540 A116541 A116542 this_sequence A116544 A116545 
               A116546
%K A116543 nonn
%O A116543 1,5
%A A116543 James Davis (math-man(AT)tamu.edu), Mar 28 2006, Jun 07 2006
%E A116543 Edited by N. J. A. Sloane (njas(AT)research.att.com), Aug 10 2007