|
|
A066640
|
|
Numbers such that all divisors have only odd digits.
|
|
2
|
|
|
1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 31, 33, 35, 37, 39, 51, 53, 55, 57, 59, 71, 73, 77, 79, 91, 93, 95, 97, 99, 111, 113, 117, 119, 131, 133, 137, 139, 151, 153, 155, 157, 159, 171, 173, 177, 179, 191, 193, 197, 199
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
77 = 11 * 7 belongs to this sequence but 75 does not as 25 (with a 2) divides 75.
|
|
MATHEMATICA
|
Select[Range[250], And@@OddQ/@Flatten[IntegerDigits/@Divisors[ # ]]&]
|
|
PROG
|
(PARI) f(n)=vecmin(Vec(Vecsmall(Str(n)))%2)
(Python)
from itertools import islice, count
from sympy import divisors
def A066640(): return filter(lambda n: all(set(str(m)) <= {'1', '3', '5', '7', '9'} for m in divisors(n, generator=True)), count(1, 2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|