|
|
A353441
|
|
Integers m such that the decimal expansion of 1/m contains the digit 5.
|
|
9
|
|
|
2, 4, 7, 8, 14, 16, 17, 18, 19, 20, 22, 23, 26, 28, 29, 31, 32, 34, 35, 38, 39, 40, 42, 43, 46, 47, 49, 51, 53, 54, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 74, 76, 78, 79, 80, 81, 82, 83, 85, 86, 87, 89, 92, 93, 94, 95, 97, 98, 102, 103, 104, 105, 106, 107, 108, 109
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
If m is a term, 10*m is also a term, so terms with no trailing zeros are all primitive terms.
|
|
LINKS
|
|
|
EXAMPLE
|
m = 7 is a term since 1/7 = 0.142857142857...
m = 22 is a term since 1/22 = 0.04545454545... (here, 5 is the largest digit).
m = 132 is a term since 1/693 = 0.00757575... (here, 5 is the smallest digit).
|
|
MAPLE
|
filter:= proc(n) local q;
q:= NumberTheory:-RepeatingDecimal(1/n);
member(5, RepeatingPart(q)) or member(5, NonRepeatingPart(q))
end proc:
|
|
MATHEMATICA
|
f[n_] := Union[ Flatten[ RealDigits[ 1/n][[1]] ]]; Select[ Range@ 125, MemberQ[f@#, 5] &]
|
|
PROG
|
(Python)
from itertools import count, islice
from sympy import multiplicity, n_order
def A353441_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 '5' in str(c:=k//a) or '5' in str(m*k//a-c*m):
yield a
|
|
CROSSREFS
|
A351471 (largest digit=5) and A352159 (smallest digit=5) are subsequences.
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|