This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108571 Any digit d in the sequence says: "I am part of an integer in which you'll find d digits "d". 10

%I

%S 1,22,122,212,221,333,1333,3133,3313,3331,4444,14444,22333,23233,

%T 23323,23332,32233,32323,32332,33223,33232,33322,41444,44144,44414,

%U 44441,55555,122333,123233,123323,123332,132233,132323,132332,133223,133232

%N Any digit d in the sequence says: "I am part of an integer in which you'll find d digits "d".

%C The sequence is finite. Last term: 999999999888888887777777666666555554444333221.

%C Number of terms is 66712890763701234740813164553708284. - _Zak Seidov_, Jan 02 2007

%C Fixed points of A139337. - _Reinhard Zumkeller_, Apr 14 2008

%C Sequence contains squares (A181392) and cubes (A225886) but no higher powers, see Comments in A181392. - _Giovanni Resta_, May 19 2013

%H T. D. Noe, <a href="/A108571/b108571.txt">Table of n, a(n) for n=1..21056</a> (terms < 10^10)

%e 23323 is in the sequence because it has two 2's and three 3's.

%e 23332 is in the sequence because it has two 2's and three 3's.

%e 23333 is not in the sequence because it has only one 2 and four 3's.

%o (PARI) is(n)={ vecmin(n=vecsort(digits(n))) && #n==normlp(Set(n),1) && !for(i=1,#n, n[i+n[i]-1]==n[i] || return; i+n[i]>#n || n[i+n[i]]>n[i] || return; n[i]>1 && i+=n[i]-1)} \\ _M. F. Hasler_, Sep 22 2014

%Y Cf. A127007, A139337, A181392, A225886.

%K base,easy,fini,nonn

%O 1,2

%A _Eric Angelini_, Jul 05 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 21 03:44 EDT 2019. Contains 323434 sequences. (Running on oeis4.)