|
|
A351473
|
|
Numbers m such that the largest digit in the decimal expansion of 1/m is 7.
|
|
5
|
|
|
27, 36, 37, 44, 132, 135, 148, 234, 270, 288, 292, 297, 308, 315, 360, 364, 369, 370, 404, 407, 440, 468, 576, 616, 636, 657, 707, 728, 756, 808, 864, 1287, 1295, 1313, 1314, 1320, 1332, 1350, 1365, 1375, 1386, 1404, 1408, 1476, 1480, 1485, 1507, 1512, 1752, 1804, 1896
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
If k is a term, 10*k is also a term.
First few primitive terms are 27, 36, 37, 44, 132, 135, 148, 234, 288, ...
The unique prime up to 2.6*10^8 is 37 (see comments in A333237 and example).
Subsequence: {132, 1332, 13332, ...} = A073551 \ {2, 12}.
|
|
LINKS
|
|
|
EXAMPLE
|
As 1/37 = 0.027027027..., 37 is a term.
As 1/148 = 0.00675675675675..., 148 is a term.
|
|
MATHEMATICA
|
f[n_] := Union[ Flatten[ RealDigits[ 1/n][[1]] ]]; Select[Range@1500000, Max@ f@# == 7 &]
|
|
PROG
|
(Python)
from itertools import count, islice
from sympy import multiplicity, n_order
def A351473_gen(startvalue=1): # generator of terms >= startvalue
for a in count(max(startvalue, 1)):
m2, m5 = (~a&a-1).bit_length(), multiplicity(5, a)
k, m = 10**max(m2, m5), 10**n_order(10, a//(1<<m2)//5**m5)-1
if max(max(str(c:=k//a)), max(str(m*k//a-c*m)))=='7':
yield a
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|