

A134595


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


2



1080548820, 1121114531, 1010249842, 1115859543, 1064928464, 1105018975, 1026605496, 1303211957, 1012880068, 1113933789, 1002529000, 1139156391, 1080784472, 1121350183, 1010485494, 1111055105, 1000603246, 1101719337
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

Obviously, each such number has at least ten digits. Smaller numbers (like 1020005640 for 0 mod m) can be extended (to 10200056405).


LINKS

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


EXAMPLE

a(1) = 1121114531 because 11 == 1 mod 2, 112 == 1 mod 3, 1211 == 1 mod 4, ..., 1121114531 == 1 mod 10 but there is no digit such that 1121114531d == 1 mod 11. (10 is not a digit.)


CROSSREFS

Cf. A051883, A132185, A132187.
Sequence in context: A017626 A122971 A139571 * A217610 A219319 A108322
Adjacent sequences: A134592 A134593 A134594 * A134596 A134597 A134598


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



