login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095231 a(1)=1; a(n)=least positive integer such that the concatenation of all terms, including a(n), is == 1 (mod n). 2
1, 1, 2, 1, 1, 1, 4, 5, 3, 1, 14, 9, 7, 7, 1, 3, 25, 5, 25, 21, 2, 9, 32, 1, 26, 5, 5, 17, 33, 1, 15, 21, 30, 37, 11, 33, 15, 27, 15, 21, 33, 51, 34, 53, 21, 29, 3, 13, 20, 1, 39, 57, 19, 35, 11, 29, 29, 31, 59, 21, 55, 51, 29, 7, 26, 75, 34, 49, 25, 31, 47, 3, 43, 77, 6, 45, 62, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Conjecture: Every natural number occurs infinitely many times.

First differs from A140274 at a(17)=25. - Owen Whitby, May 20 2008

LINKS

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

EXAMPLE

a(6) =1: 112111 mod 6 == 1.

MATHEMATICA

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

CROSSREFS

Cf. A140274.

Sequence in context: A245184 A284414 A140274 * A303697 A342413 A202019

Adjacent sequences:  A095228 A095229 A095230 * A095232 A095233 A095234

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Jun 11 2004

EXTENSIONS

Edited and extended by Owen Whitby, May 20 2008

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 October 25 20:31 EDT 2021. Contains 348256 sequences. (Running on oeis4.)