The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A113538 This list of numbers a(i) has the property that every left-subset of length n > 0 of the numbers a(i) is divisible by i+n and are the largest such integers for every i. 1
3608528850368400786036725, 45654723072420840000, 3654081096960006804, 45088208494568, 54648000, 6327096165, 7290842, 81072, 902468, 30849008, 55258568, 247808, 658563, 705672, 304380098, 6462, 342006, 7220, 38016725, 6094 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
HP-museum mailing list, an algorithm for finding a(0): HP71B algorithm.
PROG
(PARI) issalami(p, order) = ok=1; count=truncate(log(p)/log(10)+1); ordlen=truncate(log(order)/log(10)); for(i=1, count-ordlen, test=(truncate(p/10^(count-i-ordlen)+0.)/(i+order-1)); if(test!=truncate(test+0.), ok=0)); return(ok) findsalami(x, order) = for(i=0, 9, if(issalami(x*10+i, order)==1, if(maxsalami<x*10+i, maxsalami=x*10+i); findsalami(x*10+i, order))) for(order=1, 30, maxsalami=0; for(t=1, 99, findsalami(t, order)); print("Order "order":"maxsalami))
CROSSREFS
Sequence in context: A104322 A030198 A104267 * A280347 A009190 A095444
KEYWORD
nonn
AUTHOR
Christ van Willegen (cvwillegen(AT)gmail.com), Jan 13 2006
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 May 28 12:54 EDT 2024. Contains 372913 sequences. (Running on oeis4.)