|
%I #16 Dec 03 2014 07:08:15
%S 1234567,1234576,1234657,1234675,1234756,1234765,1235467,1235476,
%T 1235647,1235674,1235746,1235764,1236457,1236475,1236547,1236574,
%U 1236745,1236754,1237456,1237465,1237546,1237564,1237645,1237654
%N Permutations of 1234567: Numbers having each of the decimal digits 1,...,7 exactly once, and no other digit.
%C It would be nice to have a simple explicit formula for the n-th term.
%C Contains A000142(7) = 5040 terms. - _R. J. Mathar_, Apr 08 2011
%C An efficient procedure for generating the n-th term of this sequence can be found at A178475. - _Nathaniel Johnston_, May 19 2011
%H Nathaniel Johnston, <a href="/A178477/b178477.txt">Table of n, a(n) for n = 1..5040</a> (full sequence)
%t FromDigits/@Take[Permutations[Range[7]],50] (* _Harvey P. Dale_, Nov 11 2012 *)
%o (PARI) is_A178477(x)= { vecsort(Vec(Str(x)))==Vec("1234567") }
%Y Cf. A030298, A030299, A055089, A060117, A178475, A178476.
%K nonn,fini,full,easy,base
%O 1,1
%A _M. F. Hasler_, Oct 09 2010
|
