Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078398
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078398 a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that begins with n concatenations of n. +0
2
1, 22, 33308, 444428644, 55555358214576, 66666652078924058304, 777777763142968864369469376, 88888888549672607030171696176233216, 99999999973937237107633586318949152704932864 (list; graph; listen)
OFFSET

1,2

PROGRAM

(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: A013727 A028692 A127486 this_sequence A060619 A092212 A013770

Adjacent sequences: A078395 A078396 A078397 this_sequence A078399 A078400 A078401

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 26 2002

EXTENSIONS

Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 04 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research