|
| |
|
|
A062634
|
|
Every divisor contains the digit 1.
|
|
5
| |
|
|
1, 11, 13, 17, 19, 31, 41, 61, 71, 101, 103, 107, 109, 113, 121, 127, 131, 137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 179, 181, 187, 191, 193, 197, 199, 211, 221, 241, 251, 271, 281, 311, 313, 317, 331, 341, 361, 401, 419, 421, 431, 451, 461, 491, 521
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| 143 has divisors 1, 11, 13 and 143, all of which contain the digit 1
|
|
|
PROG
| (Haskell)
a062634 n = a062634_list !! (n-1)
a062634_list = filter
(and . map ((elem '1') . show) . a027750_row) a011531_list
-- Reinhard Zumkeller, Feb 05 2012
|
|
|
CROSSREFS
| Cf. a027750, subsequence of A011531, A206159 is a subsequence.
Sequence in context: A154981 A092912 A092911 * A206159 A106101 A032590
Adjacent sequences: A062631 A062632 A062633 * A062635 A062636 A062637
|
|
|
KEYWORD
| base,easy,nonn,changed
|
|
|
AUTHOR
| Erich Friedman (efriedma(AT)stetson.edu), Jul 04 2001
|
|
|
EXTENSIONS
| Offset corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 05 2012
|
| |
|
|
