login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134597 a(n) gives the maximal value of A075053(m) for any n-digit number m. 6
1, 4, 11, 31, 106, 402, 1953 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

In A075053(m), the primes obtained as permutations of digits of m are counted several times if they can be obtained in several different ways. See sequence A076730 which uses A039993 instead, i.e., counting only different primes. - M. F. Hasler, Mar 11 2014

The original data given for n = 3, 4, 5 was erroneously A007526(n). - Up to n = 6, a(n) = A076730(n), but the two will differ not later than for n = 10, where A134596(10) = 1123456789 gives a(10) >= 398100 = A075053(1123456789) > A039993(1123456789) = 362451 = A076730(10). The difference arises because each prime containing a single '1' will be counted twice by A075053, but only once by A039993. - M. F. Hasler, Oct 14 2019

LINKS

Table of n, a(n) for n=1..7.

M. Keith, Integers containing many embedded primes

FORMULA

a(n) <= A007526(n), with equality iff n <= 2. [Keith]

a(n) = max { A075053(m); 10^(n-1) <= m < 10^n } >= A076730(n) = max { A039993(m); 10^(n-1) <= m < 10^n }. - M. F. Hasler, Mar 11 2014

EXAMPLE

From M. F. Hasler, Oct 14 2019: (Start)

a(2) = 4 = A075053(37), because from 37 one can obtain the primes {3, 7, 37, 73}, and there is obviously no 2-digit number which could give more primes.

a(3) = 11 = A075053(137), because from 137 one can obtain the primes {3, 7, 13, 17, 31, 37, 71, 73, 137, 173, 317}, and no 3-digit number yields more.

a(4) = 31 = A075053(1379), because from 1379 one can obtain the 31 primes {3, 7, 13, 17, 19, 31, 37, 71, 73, 79, 97, 137, 139, 173, 179, 193, 197, 317, 379, 397, 719, 739, 937, 971, 1973, 3719, 3917, 7193, 9137, 9173, 9371}, and no 4-digit number yields more.

a(5) = 106 = A075053(13679). a(6) = 402 = A075053(123479).

a(7) = 1953 = A075053(1234679). (End)

PROG

(PARI) A134597(n)={my(m=0); forvec(D=vector(n, i, [0, 9]), vecsum(D)%3||next; m=max(A075053(fromdigits(D), D), m), 1); m} \\ M. F. Hasler, Oct 14 2019

CROSSREFS

Cf. A075053, A039993, A134596.

Cf. A239196 for record indices of A075053, A239197 for associated record values.

Sequence in context: A282856 A296572 A176573 * A076730 A084757 A155962

Adjacent sequences:  A134594 A134595 A134596 * A134598 A134599 A134600

KEYWORD

nonn,base,more

AUTHOR

N. J. A. Sloane, Jan 25 2008

EXTENSIONS

Link fixed by Charles R Greathouse IV, Aug 13 2009

Definition corrected by M. F. Hasler, Mar 11 2014

Data corrected and extended by M. F. Hasler, Oct 14 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)