This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A068862 #8 Mar 03 2016 22:46:52 %S A068862 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 A068862 888,911,1088,3110,7111,10879 %N A068862 Numbers n such that A068861(n) = n. %p A068862 V:= Vector(10^5): %p A068862 V[1]:= 1: m:= 2: %p A068862 count:= 1: A[1]:= 1: %p A068862 L:= [1]: %p A068862 for n from 2 to 12000 do %p A068862 for i from m to 10^5 do %p A068862 if V[i] = 0 then %p A068862 LL:= convert(i,base,10); %p A068862 k:= min(nops(L),nops(LL)); %p A068862 if not has(LL[1..k] - L[1..k],0) then %p A068862 V[i]:= n; %p A068862 if i = m then %p A068862 for m from m+1 while V[m] <> 0 do od: %p A068862 fi; %p A068862 if i = n then %p A068862 count:= count+1; %p A068862 A[count]:= n; %p A068862 fi; %p A068862 L:= LL; %p A068862 break %p A068862 fi %p A068862 fi %p A068862 od; %p A068862 if i = 10^5 + 1 then break fi %p A068862 od: %p A068862 seq(A[i],i=1..count); # _Robert Israel_, Mar 03 2016 %Y A068862 Cf. A068860, A068861. %K A068862 base,nonn %O A068862 1,2 %A A068862 _Amarnath Murthy_, Mar 13 2002 %E A068862 a(19)-a(30) from _Robert Israel_, Mar 03 2016