%I A103266
%S A103266 1,2,3,2,2,2,3,2,4,2,1,2,2,2,3,2,3,2,3,2,4,2,3,2,2,2,3,2,3,2,3,2,4,2,3,
%T A103266 2,2,2,3,2,3,2,3,2,4,2,3,2,3,2,3,2,3,2,3,2,4,2,3,2,2,2,3,2,3,2,3,2,4,2,
%U A103266 3,2,2,2,3,2,3,2,3,2,4,2,4,2,2,2,3,2,3,2,3,2,4,2,3,2,2,2,3,2,3,2,3,2,4
%N A103266 Minimal number of squares needed to sum to Fibonacci(n+1).
%C A103266 Since every positive integer is the sum of four squares, no term is greater 
               than 4. Also, since any positive integer not of the form 4^k(8m+7) 
               is the sum 3 or fewer squares, the next occurrences of a(n)=4 are 
               at n = 45, 57, 69, 81, 83, 93,.... - John W. Layman (layman(AT)math.vt.edu), 
               Mar 30 2005
%D A103266 Hardy and Wright, An Introduction to the Theory of Numbers, Fourth Ed., 
               Oxford, Section 20.10.
%F A103266 a(n) = A002828(A000045(n+1)).
%e A103266 Fibonacci(10+1) = 89 = 25+64, so a(10)=2.
%Y A103266 Cf. A000045, A002828.
%Y A103266 Sequence in context: A078832 A086410 A147561 this_sequence A072814 A145390 
               A128049
%Y A103266 Adjacent sequences: A103263 A103264 A103265 this_sequence A103267 A103268 
               A103269
%K A103266 nonn
%O A103266 1,2
%A A103266 Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Mar 20 2005
%E A103266 Corrected and extended by John W. Layman (layman(AT)math.vt.edu), Mar 
               30 2005
%E A103266 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 16 2005