id:A101227 - OEIS Search Results

Search: id:A101227

Displaying 1-1 of 1 results found.

page 1

Number of solutions to equation n=x+largest digit of x, n>1.

+0
1

1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 2, 1, 2, 0, 2, 0, 2, 0, 1, 0, 1, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 1, 1, 2, 1, 2, 1, 1, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1 (list; graph; listen)

	OFFSET	`2,11`
	COMMENT	`In A045844, a sequence is defined by a rule a(n+1) = a(n) + largest digit of a(n); a(0) = 1. As usually in such cases, direct transformation is unique, while reverse one is not. Here the number of possible "previous" terms is given for each n.`
	EXAMPLE	`a(12)=2 because 12=6+6, and 12=11+1; a(101)=2 because 101=92+9, and 101=100+1; note offset=2.`
	CROSSREFS	`Cf. A045844.` `Sequence in context: A029832 A026611 A096972 this_sequence A021499 A084099 A010673` `Adjacent sequences: A101224 A101225 A101226 this_sequence A101228 A101229 A101230`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Jan 22 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research