login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078398 a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that begins with n concatenations of n. 1

%I #4 Dec 05 2013 19:55:58

%S 1,22,33308,444428644,55555358214576,66666652078924058304,

%T 777777763142968864369469376,88888888549672607030171696176233216,

%U 99999999973937237107633586318949152704932864

%N a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that begins with n concatenations of n.

%o (PARI) {print1(a=1,","); for(n=2,9,k=floor(log(a)/log(10))+1; v=Str(n); for(i=2,n, v=concat(v,Str(n))); s=eval(v); t=s+1; m=floor(log(s)/log(10))+1; d=k-m; s=s*10^d; t=t*10^d; b=1; j=d; while(b>0,q=floor(s/a); while(b>0&&(p=q*a)<t,if(p>=s,print1(p,","); b=0,q++)); s=10*s; t=10*t); a=p)}

%Y Cf. A078399.

%K base,nonn

%O 1,2

%A _Amarnath Murthy_, Nov 26 2002

%E Edited and extended by _Klaus Brockhaus_, Dec 04 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 01:19 EDT 2024. Contains 371906 sequences. (Running on oeis4.)