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
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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
CROSSREFS
Sequence in context: A297274 A048322 A048335 * A061729 A286126 A249157
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Mar 13 2002
EXTENSIONS
a(19)-a(30) from Robert Israel, Mar 03 2016
STATUS
approved

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 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)