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
1, 22, 33308, 444428644, 55555358214576, 66666652078924058304, 777777763142968864369469376, 88888888549672607030171696176233216, 99999999973937237107633586318949152704932864 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..9.

PROG

(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)}

CROSSREFS

Cf. A078399.

Sequence in context: A232847 A191946 A221639 * A280812 A060619 A238635

Adjacent sequences:  A078395 A078396 A078397 * A078399 A078400 A078401

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Nov 26 2002

EXTENSIONS

Edited and extended by Klaus Brockhaus, Dec 04 2002

STATUS

approved

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 August 7 11:38 EDT 2022. Contains 355985 sequences. (Running on oeis4.)