A132187 a(n) pertains to numbers x such that, for any m, the number formed from the first m digits of x is congruent to n mod m; but no digit can be appended to maintain the condition. a(n) is the quantity of such numbers.

294, 268, 284, 260, 264, 281, 261, 286, 267, 244, 292, 265, 286, 300, 260, 293, 297, 281, 274, 262, 240, 259, 277, 296, 306, 266, 280, 259, 263, 284, 265, 293, 287, 259, 287, 273, 270, 298, 245, 257, 286, 257, 292, 272, 264, 286, 287, 310, 294, 268, 257

Offset

0,1

Comments

The smallest number for each n is A134595, the largest is A132185.

Links

Table of n, a(n) for n=0..50.

Crossrefs

Cf. A051883, A132185, A134595.

Sequence in context: A239825 A145206 A153579 * A367207 A255104 A212724

Adjacent sequences: A132184 A132185 A132186 * A132188 A132189 A132190

Keyword

nonn,base,easy

Author

Philippe LALLOUET (philip.lallouet(AT)orange.fr), Nov 04 2007

Extensions

Edited by Don Reble, Nov 07 2007

Status

approved