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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 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

%I

%S 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,

%T 15,21,30,37,11,33,15,27,15,21,33,51,34,53,21,29,3,13,20,1,39,57,19,

%U 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

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

%C Conjecture: Every natural number occurs infinitely many times.

%C First differs from A140274 at a(17)=25. - _Owen Whitby_, May 20 2008

%H Owen Whitby, <a href="/A095231/b095231.txt">Table of n, a(n) for n = 1..200</a>

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

%t 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

%Y Cf. A140274.

%K base,nonn

%O 1,3

%A _Amarnath Murthy_, Jun 11 2004

%E Edited and extended by _Owen Whitby_, May 20 2008

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.

Last modified December 8 03:17 EST 2021. Contains 349590 sequences. (Running on oeis4.)