id:A147870 - OEIS Search Results

Search: id:A147870

Displaying 1-1 of 1 results found.

page 1

Number of steps required to erase a string in the following way: at the n-th step, if the last digit of the string is 0, delete it; otherwise replace it with n copies of the next-smaller digit.

+0
1

2, 4, 14, 22539988369406 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`The fifth term is much larger than Skewes's number.`
	LINKS	`Sudoku.com, off-topic, How NOT to erase pencil-marks!`
	EXAMPLE	`3 is erased in 14 steps:` `3->2->11->1000->100->10->1->0000000->000000->00000->0000->000->00->0->x`
	CROSSREFS	`Sequence in context: A132531 A123052 A064773 this_sequence A163361 A019543 A154906` `Adjacent sequences: A147867 A147868 A147869 this_sequence A147871 A147872 A147873`
	KEYWORD	`nonn`
	AUTHOR	`Martin Chan (martin.chan(AT)westminster.org.uk), Nov 16 2008`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research