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.

Showing 1-1 of 1 results.

A086818 a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).

Original entry on oeis.org

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
Offset: 1

Views

Author

Ray Chandler, Aug 06 2003

Keywords

Comments

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

Crossrefs

Cf. A077712.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.