|
| |
|
|
A062584
|
|
First occurrence of n in the decimal representation of primes.
|
|
13
| |
|
|
101, 11, 2, 3, 41, 5, 61, 7, 83, 19, 101, 11, 127, 13, 149, 151, 163, 17, 181, 19, 1201, 211, 223, 23, 241, 251, 263, 127, 281, 29, 307, 31, 1321, 233, 347, 353, 367, 37, 383, 139, 401, 41, 421, 43, 443, 457, 461, 47, 487, 149, 503, 151, 521, 53, 541, 557, 563
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
|
|
|
EXAMPLE
| 0 first occurs in 101. 14 first occurs as a substring in 149.
|
|
|
MATHEMATICA
| Do[k = 1; While[ StringPosition[ ToString[Prime[k]], ToString[n]] == {}, k++ ]; Print[ Prime[k]], {n, 0, 62} ]
|
|
|
PROG
| (Haskell)
import Data.List (isInfixOf)
a062584 n = head [p | p <- a000040_list, show n `isInfixOf` show p]
-- Reinhard Zumkeller, Dec 29 2011
|
|
|
CROSSREFS
| Cf. A018800, A060386. Similar to but different from A068164. E.g. a(133) = 4133, but A068164(133) = 1033.
Sequence in context: A126834 A180236 A060386 * A085054 A084045 A085419
Adjacent sequences: A062581 A062582 A062583 * A062585 A062586 A062587
|
|
|
KEYWORD
| easy,nonn,base,nice
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Jul 03 2001
|
|
|
EXTENSIONS
| More terms from Lior Manor (lior.manor(AT)gmail.com) Jul 08 2001. Corrected by Larry Reeves (larryr(AT)acm.org), Jul 10 2001. Further correction from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2001.
|
| |
|
|
