|
| |
|
|
A062679
|
|
Numbers such that every divisor (except 1, but including the number itself) contains the digit 9.
|
|
2
| |
|
|
19, 29, 59, 79, 89, 97, 109, 139, 149, 179, 191, 193, 197, 199, 229, 239, 269, 293, 349, 359, 379, 389, 397, 409, 419, 439, 449, 479, 491, 499, 509, 569, 593, 599, 619, 659, 691, 709, 719, 739, 769, 797, 809, 829, 839, 859, 907, 911, 919, 929, 937, 941, 947
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Different from A106093. 1691 = 19 * 89 is the smallest term that is not in A106093. - Franklin T. Adams-Watters, Apr 30 2007
|
|
|
EXAMPLE
| 7961 has divisors 19, 419 and 7961, all of which contain the digit 9.
|
|
|
MATHEMATICA
| fQ[n_] := Union[ Drop[Last /@ Sort /@ IntegerDigits[ Divisors[ n]], 1]] == {9}; Select[ Range[ 952], fQ[ # ] == True &] (from Robert G. Wilson v (rgwv(AT)rgwv.com), May 17 2005)
|
|
|
CROSSREFS
| Sequence in context: A092600 A106124 * A106093 A084666 A004618 A030433
Adjacent sequences: A062676 A062677 A062678 * A062680 A062681 A062682
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Erich Friedman (efriedma(AT)stetson.edu), Jul 04 2001
|
| |
|
|
