|
%I #15 Feb 21 2019 23:16:02
%S 1,2,3,4,5,6,7,8,9,10,12,13,14,15,16,17,18,19,20,23,24,25,26,27,28,29,
%T 30,34,35,36,37,38,39,40,45,46,47,48,49,50,56,57,58,59,60,67,68,69,70,
%U 78,79,80,89,90,102,103,104,105,106,107,108,109,123,124,125
%N List of positive integers, omitting any number n if another number with the same set of digits as n has already been listed.
%C Numbers 1 to 10 are all new sets of digits. 11 is omitted because its digit set {1} is the same as that of 1. The following numbers are included, until 21 which has the same digit set as 12, and 22 which has the same set as 2.
%C This sequence is of course finite and has 1022 terms; the number of possible digit sets excluding the empty set and {0}.
%H Nathaniel Johnston, <a href="/A179308/b179308.txt">Table of n, a(n) for n = 1..1022</a> (full sequence)
%p s:={}: for n from 1 to 1000 do d:=convert(convert(n,base,10),set): if(not member(d,s))then printf("%d, ",n): s:=s union {d}: fi: od: # _Nathaniel Johnston_, Jun 21 2011
%Y A subsequence of A179239.
%K base,easy,fini,full,nonn
%O 1,2
%A _Jack W Grahl_, Jul 10 2010
%E Corrected by _Jack W Grahl_, Jan 10 2011
|
