A285936 Number of rotations of the digits in n produced by n * x/y where x != y.

0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 2

Offset: 10

Author

Doug Bell, Jun 14 2017

Keywords

• nonn
• base

Comments

Rotations with a leading digit of zero are omitted.

If d is the number of nonzero digits in n, a(n) < d.

Examples

			a(13) = 0 because there is no fraction x/y such that 13 * x/y = 31, the only rotation of 13;
a(15) = 1 because 15 * 17/5 = 51, the only rotation 51;
a(114) = 2 because 114 * 47/38 = 141 and 114 * 137/38 = 411, both the rotations of 114.
		

Links

• Doug Bell, Table of n, a(n) for n = 10..10000