Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078296
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A078296
%S A078296 1,12,1236,1234764,12345170472,1234566427881888,1234567662448315881888,
%T A078296 123456781059643537568590582656,12345678970161821174363821245734078592,
%U A078296 123456789109025621175870796087877366124764227584
%N A078296 a(1) = 1, a(n) for n > 1 is the smallest multiple of a(n-1) that begins 
               with the concatenation 123... up to n.
%e A078296 For n = 3 we have a(n-1) = a(2) = 12; 103*12 = 1236 is the smallest multiple 
               of a(2) that begins with 123, so a(3) = 1236.
%o A078296 (PARI) {print1(a=1,","); for(n=2,10,k=floor(log(a)/log(10))+1; v=Str(1); 
               for(i=2,n, v=concat(v,Str(i))); 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 A078296 Cf. A078395, A078396, A078397.
%Y A078296 Sequence in context: A080814 A078294 A009155 this_sequence A137343 A133461 
               A071309
%Y A078296 Adjacent sequences: A078293 A078294 A078295 this_sequence A078297 A078298 
               A078299
%K A078296 base,nonn
%O A078296 1,2
%A A078296 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 26 2002
%E A078296 Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Dec 06 2002

    
page 1

Search completed in 0.001 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research