id:A107433 - OEIS Search Results

Search: id:A107433

Displaying 1-1 of 1 results found.

page 1

Slowest increasing sequence where some digit of a(n) and some digit of a(n+1) add up to 9.

+0
2

0, 9, 10, 18, 19, 20, 27, 28, 31, 36, 37, 42, 45, 46, 50, 54, 55, 64, 65, 73, 76, 82, 87, 91, 98, 100, 108, 109, 110, 118, 119, 120, 127, 128, 129, 130, 136, 137, 138, 139, 140, 145, 146, 148, 149, 150, 154, 155, 158, 159, 160, 163, 164, 165, 168, 169, 170, 172, 173 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Starting with another "seed" than 0 would produce another sequence.`
	EXAMPLE	`After 28 we must have an integer containing a "7" (2+"7"=9) or a "1" (8+"1"=9). The smallest integer satisfying this constraint is 31 (and not 37 or 41 or any other containing a "7" or a "1")`
	CROSSREFS	`Sequence in context: A045568 A088036 A100595 this_sequence A090570 A131417 A058369` `Adjacent sequences: A107430 A107431 A107432 this_sequence A107434 A107435 A107436`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Eric Angelini (eric.angelini(AT)kntv.be), Jun 09 2005`
	EXTENSIONS	`Corrected and extended by Zak Seidov (zakseidov(AT)yahoo.com), Jun 10 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research