id:A086818 - OEIS Search Results

Search: id:A086818

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	OFFSET	`1,1`
	COMMENT	`Conjecture: Terms contain exactly three 1's digits and the rest 0's digits.`
	CROSSREFS	`Cf. A077712.` `Sequence in context: A084450 A043495 A038445 this_sequence A084456 A130601 A115771` `Adjacent sequences: A086815 A086816 A086817 this_sequence A086819 A086820 A086821`
	KEYWORD	`base,nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 06 2003`

page 1

Search completed in 0.003 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research