cp's OEIS Frontend

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.

A068862 Numbers n such that A068861(n) = n.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 31, 48, 51, 68, 71, 88, 91, 108, 307, 309, 511, 688, 711, 888, 911, 1088, 3110, 7111, 10879
Offset: 1

Views

Author

Amarnath Murthy, Mar 13 2002

Keywords

Crossrefs

Programs

  • Maple
    V:= Vector(10^5):
    V[1]:= 1: m:= 2:
    count:= 1: A[1]:= 1:
    L:= [1]:
    for n from 2 to 12000 do
      for i from m to 10^5 do
        if V[i] = 0 then
          LL:= convert(i,base,10);
          k:= min(nops(L),nops(LL));
          if not has(LL[1..k] - L[1..k],0) then
            V[i]:= n;
            if i = m then
              for m from m+1 while V[m] <> 0 do od:
            fi;
            if i = n then
               count:= count+1;
               A[count]:= n;
            fi;
            L:= LL;
            break
          fi
        fi
      od;
      if i = 10^5 + 1 then break fi
    od:
    seq(A[i],i=1..count); # Robert Israel, Mar 03 2016

Extensions

a(19)-a(30) from Robert Israel, Mar 03 2016