login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086818 a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1). 0
111, 1011, 1101, 1110, 10011, 10101, 10110, 11001, 11010, 100011, 100101, 100110, 101001, 101010, 110001, 110010, 1000011, 1000101, 1000110, 1001001, 1001010, 1010001, 1010010, 1100010, 10000011, 10000101, 10000110, 10001001, 10001010 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Conjecture: Terms contain exactly three 1's digits and the rest 0's digits.

LINKS

Table of n, a(n) for n=1..29.

CROSSREFS

Cf. A077712.

Sequence in context: A084450 A043495 A038445 * A084456 A283708 A284484

Adjacent sequences:  A086815 A086816 A086817 * A086819 A086820 A086821

KEYWORD

base,nonn

AUTHOR

Ray Chandler, Aug 06 2003

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 12:08 EDT 2021. Contains 348048 sequences. (Running on oeis4.)