A211682 -id:A211682 - cp's OEIS frontend

A213301 Largest prime with n nonprime substrings (substrings with leading zeros are considered to be nonprime).

373, 3797, 37337, 37397, 373379, 831373, 973373, 3733739, 8313733, 9973331, 9721373, 52313797, 73313797, 97337333, 99793373, 373373977, 831373379, 799733317, 974313797, 991733137, 7331337337, 3797193373, 9719337973, 9917331373, 9793733797, 9974331373

Offset: 0

Hieronymus Fischer, Aug 26 2012

			a(0)=373, since 373 is the greatest prime such that all substrings are prime, hence it is the maximal prime with 0 nonprime substrings.
a(3)= 37397, since the nonprime substrings of 37337 are 9, 39 and 7397, and all greater primes have > 3 nonprime substrings.

Hieronymus Fischer, Table of n, a(n) for n = 0..25

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.

Cf. A035244, A079307, A213300 - A213321.

A213305 Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 13, 11, 127, 103, 101, 1013, 1019, 1021, 1009, 10177, 10037, 10067, 10007, 10009, 100237, 100271, 100153, 100043, 100003, 100049, 1001173, 1000313, 1000037, 1000033, 1000039, 1000003, 1000081, 10000379, 10001237, 10000223

Offset: 0

Hieronymus Fischer, Aug 26 2012

			a(0) = 2, since 2 is the least prime with zero nonprime substrings.
a(1) = 13, since 13 is the least prime with exactly 1 (“1”) nonprime substrings.
a(2) = 11, since 11 is the least prime with exactly 2 (“1” and “1”) nonprime substrings.

Hieronymus Fischer, Table of n, a(n) for n = 0..100

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.

Cf. A035244, A079307, A213300 - A213321.

a(n) > 10^floor((sqrt(8*n+1)-1)/2) for n>0.
a(m(m+1)/2) > 10^m, m>0.
a(n) >= A213302(n).

A213320 Numbers such that the number of nonprime substrings equals the number of digits (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1, 4, 6, 8, 9, 11, 12, 15, 19, 20, 21, 24, 26, 28, 30, 34, 36, 38, 39, 41, 42, 45, 50, 51, 54, 56, 58, 61, 62, 63, 65, 70, 74, 76, 78, 82, 85, 87, 89, 92, 93, 95, 117, 123, 127, 132, 133, 135, 139, 153, 157, 167, 171, 172, 175

Offset: 1

Hieronymus Fischer, Aug 26 2012

Also numbers such that the number of prime substrings is A000217(m-1) = m(m-1)/2, where m is the number of digits.
The sequence is finite. Proof: Let p be a number >= 10^17 and let m = 9k+j be the number of digits of p, where k = floor(m/9) >= 2 and j = m mod 9. Since each 9-digit number has at least 15 nonprime substrings, it follows that p has at least 15k = 9k + 6k > 9k + j = m nonprime substrings (since 6k >= 12> j for k >= 2). Consequently, no number >= 10^17 can be a term of the sequence.
The last term is a(858)=3733739. Proof: Each 9-digit number has at least 15 nonprime substrings, thus, the numbers 10^8 <= p < 10^14 also have at least 15 nonprime substrings and therefore cannot be terms of the sequence. Same is true for numbers 10^14 <= p < 10^17 since each 6-digit number has at least 4 nonprime substrings, and thus each number with >= 15 digits has at least 15+4 = 19 nonprime substrings. Since each 8-digit number has at least 10 nonprime substrings, it follows that the last term of the sequence must be less than 10^7. By direct search we find a(858) = 3733739.

			a(1) = 1, since 1 has 1 nonprime substrings.
a(43) = 117, since 117 has 3 digits and also 3 nonprime substrings (1, 1, 117).

Hieronymus Fischer, Table of n, a(n) for n = 1..858 (full sequence)

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.

Cf. A035244, A079307, A213300 - A213321.

Typo in example corrected, Hieronymus Fischer, Sep 11 2012

A217104 Minimal number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 5, 4, 19, 17, 16, 75, 67, 66, 64, 269, 263, 266, 257, 256, 1053, 1031, 1035, 1029, 1026, 1024, 4125, 4119, 4123, 4107, 4099, 4098, 4096, 16479, 16427, 16431, 16407, 16395, 16391, 16386, 16384, 65709, 65629, 65579, 65581, 65559, 65543, 65539, 65537, 65536

Offset: 0

Hieronymus Fischer, Dec 12 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty. Proof: Define m(n):=2*sum_{j=i..k} 4^j, where k:=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,... the m(n) in base-4 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s. Thus, the number of nonprime substrings of m(n) is ((k+1)*(k+2)/2)-k-1+i = (k*(k+1)/2)+i = n, which proves the statement.

If p is a number with k prime substrings and d digits (in base-4 representation), m>=d, than b := p*4^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_4 is the least number with zero nonprime substrings in base-4 representation.
a(1) = 1, since 1 = 1_4 is the least number with 1 nonprime substring in base-4 representation.
a(2) = 5, since 5 = 11_4 is the least number with 2 nonprime substrings in base-4 representation (these are 2-times 1).
a(3) = 4, since 4 = 10_4 is the least number with 3 nonprime substrings in base-4 representation (these are 0, 1 and 10).
a(4) = 19, since 19 = 103_4 is the least number with 4 nonprime substrings in base-4 representation, these are 0, 1, 10, and 03 (remember, that substrings with leading zeros are considered to be nonprime).
a(7) = 75, since 75 = 1023_4 is the least number with 7 nonprime substrings in base-4 representation, these are 0, 1, 10, 02, 023, 102 and 1023 (remember, that substrings with leading zeros are considered to be nonprime: 2_4 = 2, 3_4 = 3 and 23_4 = 11 are the only base-4 prime substrings of 75).

Hieronymus Fischer, Table of n, a(n) for n = 0..528

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300-A213321.
Cf. A217102-A217109.
Cf. A217302-A217309.

a(n) >= 4^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n is a triangular number (cf. A000217).
a(A000217(n)) = 4^(n-1), n>0.
a(A000217(n)-k) >= 4^(n-1) + k, 0<=k0.
a(A000217(n)-k) = 4^(n-1) + p, where p is the minimal number >= 0 such that 4^(n-1) + p, has k prime substrings in base-4 representation, 0<=k0.

A217105 Minimal number (in decimal representation) with n nonprime substrings in base-5 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 5, 6, 27, 25, 34, 127, 128, 125, 170, 636, 632, 627, 625, 850, 3162, 3137, 3132, 3127, 3125, 4250, 15686, 15661, 15638, 15632, 15627, 15625, 21250, 78192, 78163, 78162, 78137, 78132, 78127, 78125, 106250, 390818, 390692, 390686, 390662, 390638, 390632

Offset: 0

Hieronymus Fischer, Dec 12 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty. Proof: Define m(n):=2*sum_{j=i..k} 5^j, where k:=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,... the m(n) in base-5 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s, thus, the number of nonprime substrings of m(n) is ((k+1)*(k+2)/2)-k-1+i = (k*(k+1)/2)+i = n, which proves the statement.

If p is a number with k prime substrings and d digits (in base-5 representation), p != 1 (mod 5), m>=d, than b := p*5^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_5 is the least number with zero nonprime substrings in base-4 representation.
a(1) = 1, since 1 = 1_5 is the least number with 1 nonprime substring in base-5 representation.
a(2) = 5, since 5 = 10_5 is the least number with 2 nonprime substrings in base-5 representation (0 and 1).
a(3) = 6, since 6 = 11_5 is the least number with 3 nonprime substrings in base-5 representation (2-times 1 and 11).
a(4) = 27, since 27 = 102_5 is the least number with 4 nonprime substrings in base-5 representation, these are 0, 1, 02, and 102 (remember, that substrings with leading zeros are considered to be nonprime).
a(6) = 34, since 34 = 114_5 is the least number with 6 nonprime substrings in base-5 representation, these are 1, 1, 4, 11, 14, and 114.

Hieronymus Fischer, Table of n, a(n) for n = 0..351

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397.
Cf. A217102-A217109, A217112-A217119.
Cf. A217302-A217309.

a(n) >= 5^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n=1 or n+1 is a triangular number (cf. A000217).
a(A000217(n)-1) = 5^(n-1), n>1.
a(A000217(n)) = floor(34 * 5^(n-3)), n>0.
a(A000217(n)) = 114000...000_5 (with n digits), n>0.
a(A000217(n)-k) >= 5^(n-1) + k-1, 1<=k<=n, n>1.
a(A000217(n)-k) = 5^(n-1) + p, where p is the minimal number >= 0 such that 5^(n-1) + p, has k prime substrings in base-5 representation, 1<=k<=n, n>1.

A217106 Minimal number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 7, 6, 41, 37, 36, 223, 224, 218, 216, 1319, 1307, 1301, 1297, 1296, 7829, 7793, 7787, 7783, 7778, 7776, 46703, 46709, 46679, 46673, 46663, 46658, 46656, 280205, 280075, 279983, 279979, 279949, 279941, 279938, 279936, 1679879, 1679807, 1679699, 1679669

Offset: 0

Hieronymus Fischer, Dec 12 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty. Proof: Define m(n):=2*sum_{j=i..k} 6^j, where k:=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,... the m(n) in base-6 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s, thus, the number of nonprime substrings of m(n) is ((k+1)*(k+2)/2)-k-1+i = (k*(k+1)/2)+i = n, which proves the statement.

If p is a number with k prime substrings and d digits (in base-6 representation), m>=d, than b := p*6^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_6 is the least number with zero nonprime substrings in base-6 representation.
a(1) = 1, since 1 = 1_6 is the least number with 1 nonprime substring in base-6 representation.
a(2) = 7, since 7 = 11_6 is the least number with 2 nonprime substrings in base-6 representation (1 and 1).
a(3) = 6, since 6 = 10_6 is the least number with 3 nonprime substrings in base-6 representation (0, 1 and 10).
a(4) = 41, since 41 = 105_6 is the least number with 4 nonprime substrings in base-6 representation, these are 0, 1, 10, and 05 (remember, that substrings with leading zeros are considered to be nonprime).

Hieronymus Fischer, Table of n, a(n) for n = 0..300

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300-A213321.
Cf. A217102-A217109.
Cf. A217302-A217309.

a(n) >= 6^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n is a triangular number (cf. A000217).
a(A000217(n)) = 6^(n-1), n>0.
a(A000217(n)-k) >= 6^(n-1) + k, 0<=k0.
a(A000217(n)-k) = 6^(n-1) + p, where p is the minimal number >= 0 such that 6^(n-1) + p, has k prime substrings in base-6 representation, 0<=k0.

A217107 Minimal number (in decimal representation) with n nonprime substrings in base-7 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 7, 8, 51, 49, 57, 353, 345, 343, 400, 2417, 2411, 2403, 2401, 9604, 16880, 16823, 16829, 16809, 16807, 67228, 117763, 117721, 117666, 117659, 117651, 117649, 470596, 823709, 823664, 823615, 823560, 823553, 823545, 823543, 3294172, 5765310, 5765063

Offset: 0

Hieronymus Fischer, Dec 12 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty. Proof: Define m(n):=2*sum_{j=i..k} 7^j, where k:=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,... the m(n) in base-7 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s, thus, the number of nonprime substrings of m(n) is ((k+1)*(k+2)/2)-k-1+i = (k*(k+1)/2)+i = n, which proves the statement.

If p is a number with k prime substrings and d digits (in base-7 representation), p != 1 (mod 7), m>=d, than b := p*7^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_7 is the least number with zero nonprime substrings in base-7 representation.
a(1) = 1, since 1 = 1_7 is the least number with 1 nonprime substring in base-7 representation.
a(2) = 7, since 7 = 10_7 is the least number with 2 nonprime substrings in base-7 representation (these are 0 and 1).
a(3) = 8, since 8 = 11_7 is the least number with 3 nonprime substrings in base-7 representation (1, 1 and 11).
a(4) = 51, since 51 = 102_7 is the least number with 4 nonprime substrings in base-7 representation, these are 0, 1, 02, and 102 (remember, that substrings with leading zeros are considered to be nonprime).

Hieronymus Fischer, Table of n, a(n) for n = 0..210

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300-A213321.
Cf. A217102-A217109.
Cf. A217302-A217309.

a(n) >= 7^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n=1 or n+1 is a triangular number (cf. A000217).
a(A000217(n)-1) = 7^(n-1), n>1.
a(A000217(n)) = floor(400 * 7^(n-4)), n>0.
a(A000217(n)) = 111…111_7 (with n digits), n>0.
a(A000217(n)-k) >= 7^(n-1) + k-1, 1<=k<=n, n>1.
a(A000217(n)-k) = 7^(n-1) + p, where p is the minimal number >= 0 such that 7^(n-1) + p, has k prime substrings in base-7 representation, 1<=k<=n, n>1.

A217108 Minimal number (in decimal representation) with n nonprime substrings in base-8 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 10, 8, 67, 66, 64, 523, 525, 514, 512, 4127, 4115, 4099, 4098, 4096, 32797, 32799, 32779, 32771, 32770, 32768, 262237, 262239, 262173, 262163, 262147, 262146, 262144, 2097391, 2097259, 2097211, 2097181, 2097169, 2097163, 2097154, 2097152, 16777695

Offset: 0

Hieronymus Fischer, Dec 12 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty. Proof: Define m(n):=2*sum_{j=i..k} 8^j, where k:=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,... the m(n) in base-8 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s, thus, the number of nonprime substrings of m(n) is ((k+1)*(k+2)/2)-k-1+i = (k*(k+1)/2)+i = n, which proves the statement.

If p is a number with k prime substrings and d digits (in base-8 representation), m>=d, than b := p*8^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_8 is the least number with zero nonprime substrings in base-8 representation.
a(1) = 1, since 1 = 1_8 is the least number with 1 nonprime substring in base-8 representation.
a(2) = 10, since 10 = 12_8 is the least number with 2 nonprime substrings in base-8 representation (1 and 12).
a(3) = 8, since 8 = 10_8 is the least number with 3 nonprime substrings in base-8 representation (0, 1 and 10).
a(4) = 67, since 67 = 103_8 is the least number with 4 nonprime substrings in base-8 representation, these are 0, 1, 10, and 03 (remember, that substrings with leading zeros are considered to be nonprime).

Hieronymus Fischer, Table of n, a(n) for n = 0..210

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300-A213321.
Cf. A217102-A217109.
Cf. A217302-A217309.

a(n) >= 8^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n is a triangular number (cf. A000217).
a(A000217(n)) = 8^(n-1), n>0.
a(A000217(n)-k) >= 8^(n-1) + k, 0<=k0.
a(A000217(n)-k) = 8^(n-1) + p, where p is the minimal number >= 0 such that 8^(n-1) + p, has k prime substrings in base-8 representation, 0<=k0.

A217113 Greatest number (in decimal representation) with n nonprime substrings in base-3 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 23, 71, 26, 77, 233, 239, 719, 701, 647, 725, 2159, 2177, 2158, 2157, 5822, 5741, 6551, 6476, 6532, 6531, 18944, 19436, 19655, 19601, 19673, 19653, 58310, 58309, 58316, 58967, 59021, 58964, 157211, 157217, 174950, 176408, 176407, 176903, 177065, 177064, 471653, 511511

Offset: 0

Hieronymus Fischer, Dec 20 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty and finite. Proof of existence: Define m(n):=2*sum_{j=i..k} 3^j, where k:=floor((sqrt(8n+1)-1)/2), i:= n-(k(k+1)/2). For n=0,1,2,3,... the m(n) in base-3 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s. Thus, the number of nonprime substrings of m(n) is ((k+1)(k+2)/2)-k-1+i=(k(k+1)/2)+i=n. This proves the statement of existence. Proof of finiteness: Each 2-digit base-3 number has at least 1 nonprime substring. Hence, each 2(n+1)-digit number has at least n+1 nonprime substrings. Consequently, there is a boundary b < 3^(2n+1) such that all numbers > b have more than n nonprime substrings. It follows, that the set of numbers with n nonprime substrings is finite.

			a(0) = 2, since 2 = 2_3 (base-3) is the greatest number with zero nonprime substrings in base-3 representation.
a(1) = 23 = 212_3 has 1 substring in base-3 representation (= 1). All the other base-3 substrings (2, 2, 21, 12, 212) are prime substrings. 23 is the greatest number with 1 nonprime substring.
a(2) = 71 = 2122_3 has 10 substrings in base-3 representation (1, 2, 2, 2, 12, 21, 22, 122, 212, 2122), exactly 2 of them are nonprime substrings (1 and 22_3=8), and there is no greater number with 2 nonprime substrings in base-3 representation.
a(3) = 26 = 222_3 has 6 substrings in base-3 representation, only 3 of them are prime substrings (2, 2, 2) which implies that exactly 3 substrings must be nonprime, and there is no greater number with 3 nonprime substrings in base-3 representation.

Hieronymus Fischer, Table of n, a(n) for n = 0..250

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300 - A213321.
Cf. A217102 - A217109, A217112 - A217119.
Cf. A217302 - A217309.

a(n) >= A217103(n).
a(n) >= A217303(A000217(A081604(a(n)))-n).
Example: a(12)=2177=2222122_3, A000217(A081604(2177))=28, hence a(12)>=A217303(28-12)=1934.
a(n) <= 3^min(n + 2, 5*floor((n+4)/5)).
a(n) <= 3^(n + 2).
a(n) <= 3^min((n + 11)/3, 11*floor((n+32)/33)).
a(n) <= 3^((1/3)*(n + 11)).
With m := floor(log_3(a(n))) + 1:
a(n+m+1) >= 3*a(n), if a(n)!=1 (mod 3).
a(n+m) >= 3*a(n), if a(n)=1 (mod 3).

A217118 Greatest number (in decimal representation) with n nonprime substrings in base-8 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

491, 3933, 24303, 32603, 188143, 253789, 261117, 1555423, 2030319, 2088797, 2088943, 16185163, 16710383, 16710381, 16768991, 99606365, 129884143, 133683069, 134150015, 134209503, 770611067, 1039073149, 1069408239, 1073209071, 1073209083, 1073676029, 5065578363

Offset: 0

Hieronymus Fischer, Dec 20 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is not empty and finite. Proof of existence: Define m(n):=2*sum_{j=i..k} 8^j, where k:=floor((sqrt(8n+1)-1)/2), i:= n-(k(k+1)/2). For n=0,1,2,3,... the m(n) in base-8 representation are 2, 22, 20, 222, 220, 200, 2222, 2220, 2200, 2000, 22222, 22220, .... m(n) has k+1 digits and (k-i+1) 2’s. Thus, the number of nonprime substrings of m(n) is ((k+1)(k+2)/2)-k-1+i=(k(k+1)/2)+i=n. This proves the statement of existence. Proof of finiteness: Each 4-digit base-8 number has at least 1 nonprime substring. Hence, each 4(n+1)-digit number has at least n+1 nonprime substrings. Consequently, there is a boundary b < 8^(4n+3) such that all numbers > b have more than n nonprime substrings. It follows, that the set of numbers with n nonprime substrings is finite.

			a(0) = 491, since 491 = 753_8 (base-8) is the greatest number with zero nonprime substrings in base-8 representation.
a(1) = 3933 = 7535_8 has 1 nonprime substring in base-8 representation (=7535_8). All the other base-8 substrings are prime substrings. 3933 is the greatest such number with 1 nonprime substring.
a(2) = 24303 = 57357_8 has 15 substrings in base-8 representation, exactly 2 of them are nonprime substrings (57357_8 and 735_8), and there is no greater number with 2 nonprime substrings in base-3 representation.
a(3) = 32603 = 77533_8 has 15 substrings in base-8 representation, only 3 of them are nonprime substrings (33_8, 77_8, and 7753_8), and there is no greater number with 3 nonprime substrings in base-8 representation.

Hieronymus Fischer, Table of n, a(n) for n = 0..50

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685.
Cf. A035244, A079397, A213300 - A213321.
Cf. A217102 - A217109, A217112 - A217119.
Cf. A217302 - A217309.

a(n) >= A217108(n).
a(n) >= A217308(A000217(num_digits_8(a(n)))-n), where num_digits_8(x) is the number of digits of the base-8 representation of x.
a(n) <= 8^min(n+3, 7*floor((n+6)/7)).
a(n) <= 512*8^n.
a(n+m+1) >= 8*a(n), where m := floor(log_8(a(n))) + 1.

cp's OEIS Frontend

A213301 Largest prime with n nonprime substrings (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Examples

Links

Crossrefs

A213305 Minimal prime with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

A213320 Numbers such that the number of nonprime substrings equals the number of digits (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A217104 Minimal number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217105 Minimal number (in decimal representation) with n nonprime substrings in base-5 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217106 Minimal number (in decimal representation) with n nonprime substrings in base-6 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217107 Minimal number (in decimal representation) with n nonprime substrings in base-7 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217108 Minimal number (in decimal representation) with n nonprime substrings in base-8 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217113 Greatest number (in decimal representation) with n nonprime substrings in base-3 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217118 Greatest number (in decimal representation) with n nonprime substrings in base-8 representation (substrings with leading zeros are considered to be nonprime).