OFFSET
1,1
COMMENTS
A079066(a(n)) > 0. - Reinhard Zumkeller, Jul 19 2011
Is there a prime such that the previous prime is embedded in it? - Ivan N. Ianakiev, Nov 09 2023. Answer from Amiram Eldar: No. If prime(n) is embedded in prime(n+1) then prime(n+1) has at least one digit more than prime(n), so prime(n+1) > 2 * prime(n). But according to Bertrand's postulate, prime(n+1) < 2*prime(n).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
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]; Select[ Prime@ Range@ 68, f@# > 1 &]
PROG
(Haskell)
import Data.List (findIndices)
a179924 n = a179924_list !! (n-1)
a179924_list = map (a000040 . (+ 1)) $ findIndices (> 0) a079066_list
-- Reinhard Zumkeller, Jul 19 2011
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Robert G. Wilson v, Aug 01 2010
STATUS
approved