|
|
A330486
|
|
Earliest start of a run of n numbers divisible by a seventh power larger than one.
|
|
8
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
In De Koninck's book, a(4) was probable but not certain. It also gives probable terms for a(5) and a(6).
a(6) <= 18962123650219836035505781245
a(7) <= 105574810222799317012520534891328125
a(8) <= 352061173826332779662070232460962002804453118
a(9) <= 74322635218313783849790472504951802188239215127109371
If any a(k) of these values are less than presented values, one of a(k) + m is divisible only by at least one p^7 for some p > 31, 0 <= m < k.
For a(6) this minimum prime is some prime p > 59. (End)
|
|
REFERENCES
|
J.-M. De Koninck, Those Fascinating Numbers, Entry 242, p. 63, Amer. Math. Soc., 2009.
|
|
LINKS
|
|
|
EXAMPLE
|
2372890624 is divisible by 2^7, 2372890625 is divisible by 5^7, 2372890626 is divisible by 3^7. This is the smallest number with this property, so a(3)=2372890624.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|