id:A102236 - OEIS Search Results

Search: id:A102236

Displaying 1-1 of 1 results found.

page 1

Slowest increasing sequence such that a(n) has a copy of itself in a(n+a(n)), with a(0)=0 and a(1)=1.

+0
1

0, 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 100, 101, 110, 111, 112, 113, 130, 131, 140, 141, 150, 151, 160, 161, 170, 171, 180, 181, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214 (list; graph; listen)

	OFFSET	`0,3`
	EXAMPLE	`a(3) is 11; string "11" can be found in "110", which is a(3+a(3)) = a(14).`
	CROSSREFS	`Sequence in context: A102492 A076161 A131835 this_sequence A047842 A047843 A097598` `Adjacent sequences: A102233 A102234 A102235 this_sequence A102237 A102238 A102239`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Eric Angelini (eric.angelini(AT)kntv.be), Feb 18 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research