%I A099741
%S A099741 1,1,2,2,2,3,3,3,4,4,4,5,5,5,5,5,5,7,7,7,7,7,7,8,8,8,9,9,9,9,9,9,9,9,9,
%T A099741 12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,16,16,16,16,16,
%U A099741 16,16,16,16,16,16,16,16,16,16,16,16,16,20,20,20,20,20,20,20,20,20,21
%N A099741 a(1) = 1; a(n) = a([n/2])+a([n/3]) (n >= 2).
%C A099741 Let f = f[x,y] be a Fibonacci variant with recurrence f(1) = f(2) = 1; 
               f(n) = f(ceiling((n-1)/x))+f(ceiling((n-2)/y)). This sequence is 
               f[2,3].
%C A099741 Nondecreasing. Increases only when n is of the form 2^x*3^y.
%e A099741 a(19) = a([19/2])+a([19/3]) = a(9)+a(6) = 4+3 = 7.
%Y A099741 Sequence in context: A081832 A034887 A082964 this_sequence A047743 A062299 
               A157685
%Y A099741 Adjacent sequences: A099738 A099739 A099740 this_sequence A099742 A099743 
               A099744
%K A099741 easy,nonn
%O A099741 1,3
%A A099741 Darrell Minor (dminor(AT)cscc.edu), Nov 09 2004