A140274 a(1)=1; a(n)=least nonnegative integer such that the concatenation of all terms, including a(n), is == 1 (mod n).

1, 1, 2, 1, 1, 1, 4, 5, 3, 1, 14, 9, 7, 7, 1, 3, 0, 3, 19, 21, 2, 5, 7, 21, 26, 7, 36, 33, 19, 11, 35, 37, 30, 33, 21, 33, 7, 5, 24, 1, 9, 23, 52, 17, 6, 17, 29, 29, 56, 51, 22, 17, 55, 3, 26, 33, 10, 19, 53, 21, 17, 3, 43, 37, 26, 57, 28, 9, 14, 31, 22, 73, 65, 59, 26, 69, 80, 19, 17

Offset

1,3

Comments

First differs from A095231 at a(17)=0.

Links

Owen Whitby, Table of n, a(n) for n = 1..200

Example

a(17)=0, 112111453114977130=1(mod 17)

Mathematica

digs={1}; Print[1]; Do[notFound=True; a=0; While[notFound, k=FromDigits[dk=digs~Join~IntegerDigits[a]]; If[Mod[k, n]==1, digs=dk; Print[a]; notFound=False, a++ ]], {n, 2, 200}]

Crossrefs

Cf. A095231.

Sequence in context: A245184 A284414 A355614 * A095231 A303697 A362827

Adjacent sequences: A140271 A140272 A140273 * A140275 A140276 A140277

Keyword

nonn,base

Author

Owen Whitby, May 20 2008

Status

approved