Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Mar 31 2012 13:21:27
%S 1,1,1,1,2,2,1,2,2,1,1,1,1,1,2,1,1,3,1,2,1,1,2,2,1,2,3,1,3,1,1,3,2,1,
%T 3,3,2,1,1,2,1,2,2,1,3,2,2,1,2,2,2,2,2,3,2,3,1,2,3,2,2,3,3,3,1,1
%N List consisting of all functions from [1,2,3,...,n] into [1,2,3,...,n] for n=1,2,3,... (written out in full) in lexicographic order.
%C Includes every finite sequence of positive integers. - _Franklin T. Adams-Watters_, Jan 26 2006
%e For n=1 there is one function, 1. For n=2 there are 4 such functions and ordering these lexicographically we get (1,1), (1,2), (2,1), (2,2). Thus the sequence begins 1; (1,1), (1,2), (2,1), (2,2); ...
%Y A030298.
%K nonn
%O 1,5
%A Avi Peretz (njk(AT)netvision.net.il), Feb 06 2001