Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078395
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078395 a(1) = 1, a(n) for n > 1 is the smallest multiple of a(n-1) that begins with the reverse concatenation from n to 1. +0
4
1, 21, 3213, 4321485, 5432106645, 6543211466594880, 76543214032699698271680, 8765432112983964669342594296640, 9876543213798659527816605720220081111680 (list; graph; listen)
OFFSET

1,2

EXAMPLE

For n = 3 we have a(n-1) = a(2) = 21; 153*21 = 3213 is the smallest multiple of a(2) that begins with 321, so a(3) = 3213.

PROGRAM

(PARI) {print1(a=1, ", "); for(n=2, 9, k=floor(log(a)/log(10))+1; v=Str(1); for(i=2, n, v=concat(Str(i), v)); 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. A078296, A078396, A078397.

Sequence in context: A095154 A018238 A098724 this_sequence A153833 A055416 A074053

Adjacent sequences: A078392 A078393 A078394 this_sequence A078396 A078397 A078398

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 06 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 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research