login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068862 Numbers n such that A068861(n) = n. 0

%I #8 Mar 03 2016 22:46:52

%S 1,2,3,4,5,6,7,8,9,10,12,31,48,51,68,71,88,91,108,307,309,511,688,711,

%T 888,911,1088,3110,7111,10879

%N Numbers n such that A068861(n) = n.

%p V:= Vector(10^5):

%p V[1]:= 1: m:= 2:

%p count:= 1: A[1]:= 1:

%p L:= [1]:

%p for n from 2 to 12000 do

%p for i from m to 10^5 do

%p if V[i] = 0 then

%p LL:= convert(i,base,10);

%p k:= min(nops(L),nops(LL));

%p if not has(LL[1..k] - L[1..k],0) then

%p V[i]:= n;

%p if i = m then

%p for m from m+1 while V[m] <> 0 do od:

%p fi;

%p if i = n then

%p count:= count+1;

%p A[count]:= n;

%p fi;

%p L:= LL;

%p break

%p fi

%p fi

%p od;

%p if i = 10^5 + 1 then break fi

%p od:

%p seq(A[i],i=1..count); # _Robert Israel_, Mar 03 2016

%Y Cf. A068860, A068861.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Mar 13 2002

%E a(19)-a(30) from _Robert Israel_, Mar 03 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)