%I A030298
%S A030298 1,1,2,2,1,1,2,3,1,3,2,2,1,3,2,3,1,3,1,2,3,2,1,1,2,3,4,1,2,4,3,1,3,2,4,
%T A030298 1,3,4,2,1,4,2,3,1,4,3,2,2,1,3,4,2,1,4,3,2,3,1,4,2,3,4,1,2,4,1,3,2,4,3,
%U A030298 1,3,1,2,4,3,1,4,2,3,2,1,4,3,2,4,1,3,4,1,2,3,4,2,1,4,1,2,3,4,1,3,2,4,2
%N A030298 List of permutations of 1,2,3,...,n for n=1,2,3,..., in lexicographic 
               order.
%C A030298 Contains every finite sequence of distinct numbers...infinitely many 
               times.
%F A030298 Start with 1, then 12 and 21, then the 6 permutations of 123 in lexical 
               order: 123, 132, 213, 231, 312, 321 and so on.
%e A030298 The permutations can be written as
%e A030298 1,
%e A030298 12, 21,
%e A030298 123, 132, 213, 231, 312, 321, etc.
%e A030298 Write them in order and insert commas.
%Y A030298 Cf. A098280, A098281.
%Y A030298 Sequence in context: A164516 A016533 A122915 this_sequence A098281 A103343 
               A085263
%Y A030298 Adjacent sequences: A030295 A030296 A030297 this_sequence A030299 A030300 
               A030301
%K A030298 nonn
%O A030298 1,3
%A A030298 Clark Kimberling (ck6(AT)evansville.edu)
%E A030298 Entry revised Feb 02 2006 by N. J. A. Sloane (njas(AT)research.att.com).