id:A098750 - OEIS Search Results

Search: id:A098750

Displaying 1-1 of 1 results found.

page 1

a(n+1) = a(n) + 10's complement of first digit of a(n); a(0) = 0.

+0
2

0, 10, 19, 28, 36, 43, 49, 55, 60, 64, 68, 72, 75, 78, 81, 83, 85, 87, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 109, 118, 127, 136, 145, 154, 163, 172, 181, 190, 199, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 311, 318, 325, 332, 339, 346 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`0 -> 10 because 0 + (10 - 0) = 10; 10 -> 19 because 10 + (10 - 1) = 19; 19 -> 28 because 19 + (10 - 1) = 28; 28 -> 36 because 28 + (10 - 2) = 36...` `The number of entries between m10^k and (m+1)10^k is approximately (10^k)/(10-m) (for 0<m<10). - Sam Alexander (amnalexander(AT)yahoo.com), Jan 06 2005`
	CROSSREFS	`Adjacent sequences: A098747 A098748 A098749 this_sequence A098751 A098752 A098753` `Sequence in context: A038366 A044053 A044434 this_sequence A089756 A097153 A017173`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Eric Angelini (eric.angelini(AT)kntv.be), Oct 01 2004`
	EXTENSIONS	`More terms from Sam Alexander (amnalexander(AT)yahoo.com), Jan 06 2005`

page 1

Search completed in 0.002 seconds

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.

AT&T Labs Research