%I A068049
%S A068049 2,2,2,2,2,2,3,2,2,2,3,3,2,2,2,4,3,3,2,2,2,5,4,3,3,2,2,2,6,5,4,3,3,2,2,
%T A068049 2,7,6,5,4,3,3,2,2,2,9,7,6,5,4,3,3,2,2,2,11,9,7,6,5,4,3,3,2,2,2,13,11,
%U A068049 9,7,6,5,4,3,3,2,2,2,16,13,11,9,7,6,5,4,3,3,2,2,2,19,16,13,11,9,7,6,5
%N A068049 The first term greater than one on each row of A068009. a(n) = A068009[n, 
               A002024[n]].
%C A068049 In row 1 of A068009 the first term > 1 is found at position 1, for rows 
               2 & 3 at position 2, for rows 4,5,6 at position 3, for rows 7,8,9,
               10 at position 4 etc., thus it is natural to view this also as a 
               triangular table.
%p A068049 [seq(A000009(A025581(j-1))+1,j=1..99)];
%p A068049 A025581 := n-> binomial(1+floor(1/2+sqrt(2+2*n)),2)-(n+1);
%p A068049 N := 100; t1 := series(mul(1+x^k,k=1..N),x,N); A000009 := proc(n) coeff(t1,
               x,n); end;
%Y A068049 a(n) = A000009(A025581(n-1))+1. Specifically, the left edge is equal 
               to A000009[n]+1 (i.e. apart from the first term = A052839) and the 
               right edge is all-2 sequence A007395.
%Y A068049 Sequence in context: A048052 A024708 A096917 this_sequence A141256 A131841 
               A122921
%Y A068049 Adjacent sequences: A068046 A068047 A068048 this_sequence A068050 A068051 
               A068052
%K A068049 nonn,tabl
%O A068049 1,1
%A A068049 Antti Karttunen, Feb 11 2002