%I A122196
%S A122196 1,2,3,1,4,2,5,3,1,6,4,2,7,5,3,1,8,6,4,2,9,7,5,3,1,10,8,6,4,2,11,9,7,5,
%T A122196 3,1,12,10,8,6,4,2,13,11,9,7,5,3,1,14,12,10,8,6,4,2,15,13,11,9,7,5,3,1,
%U A122196 16,14,12,10,8,6,4,2,17,15,13,11,9,7,5,3,1,18,16,14,12,10,8,6,4,2,19,17
%N A122196 Fractal sequence: count down by 2's from successive integers.
%C A122196 First differences of A076644. Fractal - deleting the first occurrence 
               of each integer leaves the original sequence. Also, original sequence 
               plus 1. 1's occur at square indices. New values occur at indices 
               m^2+1 and m^2+m+1. Ordinal transform of A122197.
%C A122196 Row sums = A002620: (1, 2, 4, 6, 9, 12, 16, 20,...). [From Gary W. Adamson 
               (qntmpkt(AT)yahoo.com), Nov 29 2008]
%C A122196 Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 05 2009: 
               (Start)
%C A122196 A122196 considered as an infinite lower triangular matrix * [1,2,3,...] 
               =
%C A122196 A006918 starting (1, 2, 5, 8, 14, 20, 30, 40,...).
%C A122196 Let A122196 = an infinite lower triangular matrix M. Lim_{n=1..inf.} 
               M^n = A171238, a left-shifted vector considered as a matrix. (End)
%e A122196 1, 2, 3,1, 4,2, 5,3,1, 6,4,2, etc.
%Y A122196 Cf. A076644, A122197, A000290, A033638.
%Y A122196 A002620 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 29 2008]
%Y A122196 Cf. A006918, A171238 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 
               05 2009]
%Y A122196 Sequence in context: A083906 A160541 A022446 this_sequence A023117 A023127 
               A125159
%Y A122196 Adjacent sequences: A122193 A122194 A122195 this_sequence A122197 A122198 
               A122199
%K A122196 easy,nonn,new
%O A122196 1,2
%A A122196 Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 25 2006