login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4
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 (list; graph; refs; listen; history; text; internal format)
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 * A255104 A212724 A235948

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 20:12 EST 2019. Contains 329961 sequences. (Running on oeis4.)