|
%I #4 Oct 12 2013 15:12:17
%S 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,
%T 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,
%U 33,10,19,53,21,17,3,43,37,26,57,28,9,14,31,22,73,65,59,26,69,80,19,17
%N a(1)=1; a(n)=least nonnegative integer such that the concatenation of all terms, including a(n), is == 1 (mod n).
%C First differs from A095231 at a(17)=0.
%H Owen Whitby, <a href="/A140274/b140274.txt">Table of n, a(n) for n = 1..200</a>
%e a(17)=0, 112111453114977130=1(mod 17)
%t 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}]
%Y Cf. A095231.
%K nonn,base
%O 1,3
%A _Owen Whitby_, May 20 2008
|
