|
%I #12 Nov 17 2018 21:49:07
%S 1,1,3,1,3,2,3,5,26,13,37,11,50,21,24,58,5,3,67,58,44,87,26,27,28,56,
%T 36,50,89,149,33,59,62,218,70,49,10,163,36,32,75,62,70,51,55,65,193,
%U 60,257,82,316,66,74,348,126,121,292,352,224,148,265,83,394,57,154,264,293,8
%N a(n) is chosen to be the least number such that concatenation a(1)a(2)a(3)...a(n-1)a(n) is congruent to n (mod prime(n)).
%H Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 28 2007, <a href="/A095246/b095246.txt">Table of n, a(n) for n = 1..100</a>
%e n = 3: prime(3) = 5 and 148 == 3 mod 5.
%t k = ""; Do[i = 1; While[Mod[ToExpression[ToString[k] <> ToString[i]], Prime[n]] != n, i++ ]; Print[i]; k = k <> ToString[i], {n, 1, 30}] (* _Ryan Propper_, Jul 02 2005 *)
%o (PARI) a=[1];print1("1,");for(n=2,100,m="";for(i=1,n-1, m=Str(m,a[i]));j=0;p=prime(n);while((eval(Str(m,j))%p) != n,j++);a=concat(a,j);print1(j",")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 28 2007
%Y Cf. A095243, A095244, A095245.
%K base,nonn
%O 1,3
%A _Amarnath Murthy_, Jun 17 2004
%E Corrected and extended by _Ryan Propper_, Jul 02 2005
%E More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 28 2007
|
