Search: id:A128118
Results 1-1 of 1 results found.

%I A128118
%S A128118 1,2,1,2,1,3,2,1,4,3,2,1,4,3,2,1,5,4,3,2,1,6,5,4,3,2,1,6,5,4,3,2,1,6,5,
%T A128118 4,3,2,1,7,6,5,4,3,2,1,7,6,5,4,3,2,1,8,7,6,5,4,3,2,1,9,8,7,6,5,4,3,2,1,
%U A128118 9,8,7,6,5,4,3,2,1,9,8,7,6,5,4,3,2,1,9,8,7,6,5,4,3,2,1,10,9,8,7,6,5,4,
               3
%N A128118 At the n-th iteration the sequence of integers from n down to 1 are appended 
               to the sequence a(n) times.
%H A128118 Reed Kelly (math(AT)keldesign.com), Feb 15 2007, <a href="b128118.txt">
               Table of n, a(n) for n = 1..555</a>
%e A128118 a(4) = 2 so 4,3,2,1,4,3,2,1 is added to the end of the sequence at the 
               fourth iteration.
%t A128118 crr[n_] := Module[ { A = {1,2,1,2,1}, i, j }, For [ i = 3, i <= n, i++, 
               A = Join[ A, Flatten[ Table[ Range[i,1,-1], {A[[i]]} ]]]; ]; A ]
%Y A128118 Cf. A128117, A001462, A002260.
%Y A128118 Sequence in context: A084532 A134583 A087467 this_sequence A107456 A165112 
               A077480
%Y A128118 Adjacent sequences: A128115 A128116 A128117 this_sequence A128119 A128120 
               A128121
%K A128118 easy,nonn
%O A128118 1,2
%A A128118 Reed Kelly (math(AT)keldesign.com), Feb 15 2007

Search completed in 0.001 seconds