|
| |
|
|
A079397
|
|
Smallest prime with memory = n.
|
|
17
| |
|
|
2, 13, 23, 113, 137, 1237, 1733, 1373, 12373, 11317, 23719, 111317, 113171, 211373, 1131379, 1113173, 1317971, 2313797, 11131733, 11373379, 23931379, 113193797, 52313797, 129733313, 113733797, 523137971, 1113179719, 1317971939
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The memory of a prime p is the number of previous primes contained as substrings in (the decimal representation of) p.
|
|
|
LINKS
| Robert G. Wilson v, (rgwv@rgwv.com), Table of n, a(n) for n = 0..30.
|
|
|
EXAMPLE
| 113 is the smallest prime with memory = 3. (The smaller primes 3, 11, 13 are substrings of 113.) Hence a(3) = 113.
|
|
|
MATHEMATICA
| f[n_] := Block[{id = IntegerDigits@n}, len = Length@id - 1; Count[ PrimeQ@ Union[ FromDigits@# & /@ Flatten[ Table[ Partition[id, k, 1], {k, len}], 1]], True] + 1]; t = Table[0, {30}]; p = 2; While[p < 11500000000, a = f@p; If[t[[a]] == 0, pp = PrimePi@p; t[[a]] = pp; Print[{a, p, pp}]]; p = NextPrime@p]; t (* From Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 03 2010 *)
|
|
|
CROSSREFS
| Cf. A079066, A035244, A035232.
Sequence in context: A035244 A085822 A093301 * A118524 A029971 A090526
Adjacent sequences: A079394 A079395 A079396 * A079398 A079399 A079400
|
|
|
KEYWORD
| base,nice,nonn
|
|
|
AUTHOR
| Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Feb 16 2003
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 25 2003
a(24) - a(30) from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 03 2010
|
| |
|
|
