A244311 Primes (with d digits, say) that generate another prime when acted on by the "standard" superpermutation of length A007489(d) of d elements (cf. comment).

13, 19, 31, 37, 79, 109, 113, 139, 193, 317, 331, 911, 991, 1453, 1481, 1669, 1831, 1901, 7127, 7561, 7589, 7687, 9343, 9413, 9811, 10223, 11821, 12889, 13627, 13633, 16979, 17551, 32297, 33529, 34157, 35747, 37409, 39521, 39829, 70957, 71339, 75653, 79633, 90289, 94793, 97583, 99877

Offset

1,1

Comments

For primes with more than four digits, the sequence is based on the current information about the conjectured minimal length.

Since 2013 it is known that the superpermutations with minimal length are not unique for n > 4, and several ones are known for n = 5, cf. Wikipedia. Accordingly, the sequence is ill-defined if the choice of the superpermutation is not made precise. It also turns out that the 6-digit terms in the b-file correspond to the palindromic superpermutation of length A007489(d) obtained by the standard algorithm described on Wikipedia or Johnston's blog. For n = 5 this is of minimal length but only third in lexicographic order, for n >= 6 it is of non-minimal length. See A332088 for the analog sequence using the lexico-first superpermutation of minimal length and including the single-digit terms. - M. F. Hasler, Jul 28 2020

"Acted on" in the definition means that the digits of the prime are 'selected' according to those of the superpermutation. This sequence uses the palindromic superpermutations generated through the standard recursive algorithm, so the corresponding primes (with A007489(d) digits) are palindromic primes (A002385). - M. F. Hasler, Jul 29 2020

Links

Abhiram R Devesh, Table of n, a(n) for n = 1..74

Nathaniel Johnston, Super Permutation

Wikipedia, Superpermutation

Example

The super-permutation of 3 objects abc with minimal length is abcabacba.
p = 109 is in this sequence as under the super-permutation with minimal length, the number 109101901 is also prime.

Prog

From M. F. Hasler, Jul 29 2020: (Start)
(PARI) my(s); #SSP=vector(6, n, s=if(n--, my(t); concat([if(#Set(s)<n, [], s=concat([s, n+1, s]); forstep(i=min(#s, #t)-1, 0, -1, if(s[1..1+i]==t[#t-i..#t], s=s[2+i..-1]; break)); t=s)|s<-[s[i+1..i+n]|i<-[0..#s-n]]]), [1])) \\ "standard" superpermutations up to n=6; see A332088 for those of minimal length
is_A244311(n)=ispseudoprime(fromdigits(vecextract(n=digits(n), SSP[#n])))
(A244311_upto(N)=select(is_A244311, primes([1, N])))(10^5) \\ (End)

Crossrefs

Cf. A007489, A002385, A180632, A332088.

Sequence in context: A243587 A085413 A342943 * A358530 A164333 A182365

Adjacent sequences: A244308 A244309 A244310 * A244312 A244313 A244314

Keyword

nonn,base

Author

Abhiram R Devesh, Jun 25 2014

Extensions

Definition corrected and keyword 'hard' removed; data and b-file double-checked by M. F. Hasler, Jul 29 2020

Status

approved