cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A383814 Least number which satisfies the requirements of A380943 in exactly n ways.

Original entry on oeis.org

2, 37, 373, 19937, 257931013, 4199993923
Offset: 0

Views

Author

Keywords

Comments

The requirements of A380943 are that primes, p_n, written in decimal representation by the concatenation of primes p and q such that the concatenation of q and p also forms a prime.

Examples

			See the examples in A383810 through A383813.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{cnt = 0, id = IntegerDigits@ n, k = 1, len, p, q, qp}, len = Length@ id; While[k < len, p = Take[id, k]; q = Take[id, -len + k]; qp = FromDigits[ Join[q, p]]; If[ PrimeQ[FromDigits[p]] && PrimeQ[FromDigits[q]] && PrimeQ[qp] && IntegerLength[qp] == len, cnt++]; k++]; cnt];a[n_]:=Module[{k=1},While[f[Prime[k]]!=n,k++];Prime[k]];Array[a,4,0]