|
Search: id:A113538
|
|
|
| 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. |
|
+0
2
|
|
| 3608528850368400786036725, 45654723072420840000, 3654081096960006804, 45088208494568, 54648000, 6327096165, 7290842, 81072, 902468, 30849008, 55258568, 247808, 658563, 705672, 304380098, 6462, 342006, 7220, 38016725, 6094
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
P. J. Hendriks, Puzzle 114, Salami-numbers
HP-museum mailing list, an algorithm for finding a(0): HP71B algorithm.
|
|
PROGRAM
|
(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 this_sequence A009190 A095444 A133849
Adjacent sequences: A113535 A113536 A113537 this_sequence A113539 A113540 A113541
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Christ van Willegen (cvwillegen(AT)gmail.com), Jan 13 2006
|
|
|
Search completed in 0.002 seconds
|
