A211684 -id:A211684 - cp's OEIS frontend

A211685 Prime numbers > 1000 such that all the substrings of length >= 3 are primes (substrings with leading '0' are considered to be nonprime).

1277, 1373, 1499, 1571, 1733, 1811, 1997, 2113, 2239, 2293, 2719, 3137, 3313, 3373, 3491, 3499, 3593, 3673, 3677, 3733, 3739, 3797, 4211, 4337, 4397, 4673, 4877, 4919, 5233, 5419, 5479, 6131, 6173, 6197, 6199, 6311, 6317, 6599, 6619, 6733

Offset: 1

Hieronymus Fischer, Jun 08 2012

Only numbers > 1000 are considered, since all 3-digit primes are trivial members.
By definition, each term of the sequence with more than 4 digits is built up by an overlapped union of previous terms, i.e., a(59)=33739 has the two embedded previous terms a(14)=3373 and a(21)=3739.
The sequence is finite, the last term is 349199 (n=63). Proof of finiteness: Let p be a number with more than 6 digits. By the argument above, each 6-digit substring of p must be a previous term. The only 6-digit term is 349199. Thus, there is no number p with the desired property.

			a(1)=1277, since all substrings of length >= 3 are primes (127, 277, and 1277).
a(63)=349199, all substrings of length >= 3 (349, 491, 919, 199, 3491, 4919, 9199, 34919, 49199 and 349199) are primes.

Hieronymus Fischer, Table of n, a(n) for n = 1..63 (complete sequence).

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

A213300 Largest number with n nonprime substrings (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

373, 3797, 37337, 73373, 373379, 831373, 3733797, 3733739, 8313733, 9973331, 37337397, 82337397, 99733313, 99733317, 99793373, 733133733, 831373379, 997333137, 997337397, 997933739, 7331337337, 8313733797, 9733733797, 9973331373, 9979337397, 9982337397

Offset: 0

Hieronymus Fischer, Aug 26 2012

The sequence is well-defined in that for each n the set of numbers with n nonprime substrings is nonempty and finite. Proof of existence: Define m(n):=2*sum_{j=i..k} 10^j, where k:=floor((sqrt(8n+1)-1)/2), i:= n - k(k+1)/2. For n=0,1,2,3,... the m(n) 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 existence. Proof of finiteness: Each 4-digit 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 < 10^(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.
The following statements hold true:
For all n>=0 there are minimal numbers with n nonprime substrings (cf. A213302 - A213304).
For all n>=0 there are maximal numbers with n nonprime substrings (= A213300 = this sequence).
For all n>=0 there are minimal numbers with n prime substrings (cf. A035244).
The greatest number with n prime substrings does not exist. Proof: If p is a number with n prime substrings, than 10*p is a greater number with n prime substrings.
Comment from N. J. A. Sloane, Sep 01 2012: it is a surprise that any number greater than 373 has a nonprime substring!

			a(0)=373, since 373 is the greatest number such that all substrings are primes, hence it is the maximal number with 0 nonprime substrings.
a(1)=3797, since the only nonprime substring of 3797 is 9 and all greater numbers have more than 1 nonprime substrings.
a(2)=37337, since the nonprime substrings of 37337 are 33 and 7337 and all greater numbers have > 2 nonprime substrings.

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

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

Cf. A035244, A079307, A213301 - A213321.

a(n) >= A035244(A000217(A055642(a(n)))-n).

A213321 Minimal prime with n prime substrings (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 13, 23, 113, 137, 373, 1973, 1733, 1373, 11317, 17333, 31379, 37337, 113173, 211373, 313739, 337397, 1113173, 1137337, 2313797, 2337397, 11131733, 12337397, 11373379, 33133733, 111733373, 113137337, 123733739, 291733373, 113733797, 1173313373, 1137333137, 1237337393, 1137337973

Offset: 1

Hieronymus Fischer, Aug 26 2012

			a(1)=2, since 2 is a prime has 1 prime substring (2).
a(2)=13, since 13 is prime and has 2 prime substrings (3 and 13)

Hieronymus Fischer, Table of n, a(n) for n = 1..40

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

Cf. A035244, A079307, A213300 - A213320.

a(n) > 10^floor((sqrt(8*n+1)-1)/2).
min(a(k), k>=n-1) <= A079397(n-1), n>0.
a(n) >= A035244(n), n>0.

A217302 Minimal natural number (in decimal representation) with n prime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1, 2, 5, 7, 11, 15, 27, 23, 31, 55, 47, 63, 111, 95, 187, 127, 223, 191, 381, 255, 447, 503, 383, 511, 1015, 895, 767, 1023, 1533, 1791, 1535, 1919, 3039, 3069, 3067, 3839, 3967, 6079, 6139, 6135, 7679, 8063, 8159, 12159, 12271, 15359, 16127

Offset: 0

Hieronymus Fischer, Nov 22 2012

The sequence is well-defined in that for each n the set of numbers with n prime substrings in binary representation is not empty. Proof: A000975(n+1) has exactly n prime substrings in binary representation (see A000975).

All terms with n > 1 are odd.

			a(1) = 2 = 10_2, since 2 is the least number with 1 prime substring (=10_2) in binary representation.
a(2) = 5 = 101_2, since 5 is the least number with 2 prime substrings in binary representation (10_2 and 101_2).
a(4) = 11 = 1011_2, since 11 is the least number with 4 prime substrings in binary representation (10_2, 11_2, 101_2 and 1011_2).
a(8) = 31 = 11111_2, since 31 is the least number with 8 prime substrings in binary representation (4 times 11_2, 3 times 111_2, and 11111_2).
a(9) = 47 = 101111_2, since 47 is the least number with 9 prime substrings in binary representation (10_2, 3 times 11_2, 101_2, 2 times 111_2, 1011_2, and 10111_2).

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

Cf. A019546, A035232, A039996, A046034, A069489, A085823, A211681, A211682, A211684, A211685, A035244, A079397, A213300-A213321, A217303-A217309, A000975.

a(n) >= 2^ceiling(sqrt(8*n+1)-1)/2).
a(n) <= A000975(n+1).
a(n+1) <= 2*a(n)+1.

A217309 Minimal natural number (in decimal representation) with n prime substrings in base-9 representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1, 2, 11, 23, 101, 173, 902, 1562, 1559, 8120, 14032, 14033, 73082, 126290, 604523, 657743, 723269, 1136684, 5918933, 5972147, 10227787, 25051529, 53276231, 54333278, 92071913, 441753767, 479669051, 483743986, 828662228, 3971590751, 4315446629

Offset: 0

Hieronymus Fischer, Nov 22 2012

The sequence is well-defined in that for each n the set of numbers with n prime substrings is not empty. Proof: Define m(0):=1, m(1):=2 and m(n+1):=9*m(n)+2 for n>0. This results in m(n)=2*sum_{j=0..n-1} 9^j = (9^n - 1)/4 or m(n)=1, 2, 22, 222, 2222, 22222, …, (in base-9) for n=0,1,2,3,…. Evidently, for n>0 m(n) has n 2’s and these are the only prime substrings in base-9 representation. This is why every substring of m(n) with more than one digit is a product of two integers > 1 (by definition) and can therefore not be a prime number.

No term is divisible by 9.

			a(1) = 2 = 2_9, since 2 is the least number with 1 prime substring in base-9 representation.
a(2) = 11 = 12_9, since 11 is the least number with 2 prime substrings in base-9 representation (2_9 and 12_9).
a(3) = 23 = 25_9, since 23 is the least number with 3 prime substrings in base-9 representation (2_9, 3_9, and 23_9).
a(4) = 101 = 122_9, since 101 is the least number with 4 prime substrings in base-9 representation (2 times 2_9, 12_9=11, and 122_9=101).
a(7) = 1562 = 2125_9, since 1562 is the least number with 7 prime substrings in base-9 representation (2 times 2_9, 5_9, 12_9=11, 21_9=19, 25_9=23, and 212_9=173).

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

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

a(n) > 9^floor(sqrt(8*n-7)-1)/2), for n>0.
a(n) <= (9^n - 1)/4, n>0.
a(n+1) <= 9*a(n)+3.

A213302 Smallest number with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

2, 1, 11, 10, 103, 101, 100, 1017, 1011, 1002, 1000, 10037, 10023, 10007, 10002, 10000, 100137, 100073, 100023, 100003, 100002, 100000, 1000313, 1000037, 1000033, 1000023, 1000003, 1000002, 1000000, 10000337, 10000223, 10000137, 10000037, 10000023, 10000013, 10000002, 10000000, 100001733

Offset: 0

Hieronymus Fischer, Aug 26 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} 10^j, where k=floor((sqrt(8*n+1)-1)/2), i:= n-A000217(k). For n=0,1,2,3,… the m(n) 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.

The 3 versions according to A213302 - A213304 are quite different. Example: 1002 has 9 nonprime substrings in version 1 (0, 0, 00, 02, 002, 1, 10 100, 1002), in version 2 there are 6 nonprime substrings (02, 002, 1, 10, 100, 1002) and there are 4 nonprime substrings in version 3 (1, 10, 100, 1002).

			a(0)=2, since 2 is the least number with zero nonprime substrings.
a(1)=1, since 1 has 1 nonprime substrings.
a(2)=11, since 11 is the least number with 2 nonprime substrings.
a(3)=10, since 10 is the least number with 3 nonprime substrings, these are 1, 0 and 10 (‘0’ will be counted).

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

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

Cf. A035244, A079307, A213300 - A213321.

a(n) >= 10^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n is a triangular number > 0 (cf. A000217).

a(A000217(n)) = 10^(n-1), n>0.

a(A000217(n)-k) >= 10^(n-1)+k, n>0, 0<=k

a(A000217(n)-1) = 10^(n-1)+2, n>3, provided 10^(n-1)+1 is not a prime (which is proved to be true for all n-1 <= 50000 (cf. A185121) except n-1=16384 and is generally true for n-1 unequal to a power of 2).

a(A000217(n)-k) = 10^(n-1)+p, where p is the minimal number such that 10^(n-1) + p, has k prime substrings, n>0, 0<=k

Min(a(A000217(n)-k-i), 0<=i<=m) <= 10^(n-1)+p, where p is the minimal number with k prime substrings and m is the number of digits of p, and k+m

Min(a(A000217(n)-k-i), 0<=i<=A055642(A035244(k)) <= 10^(n-1)+A035244(k).

a(A000217(n)-k) <= 10^(n-1)+max(p(i), k<=i<=k+m), where p(i) is the minimal number with i prime substrings and m is the number of digits of p(i), and k+m

a(A000217(n)-k) <= 10^(n-1)+max(A035244(i), k<=i<=k+ A055642(i).

a(n) <= A213305(n).

A217102 Minimal number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1, 2, 7, 5, 4, 11, 10, 12, 8, 22, 21, 19, 17, 16, 60, 39, 37, 34, 36, 32, 83, 71, 74, 69, 67, 66, 64, 143, 139, 141, 135, 134, 131, 130, 128, 283, 271, 269, 263, 267, 262, 261, 257, 256, 541, 539, 527, 526, 523, 533, 519, 514, 516, 512, 1055, 1053, 1047, 1067

Offset: 1

Hieronymus Fischer, Dec 12 2012

There are no numbers with zero nonprime substrings in binary representation. For all bases > 2 there is always a number (=2) with zero nonprime substrings (Cf. A217103-A217109, A213302).

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

			a(1) = 1, since 1 = 1_2 is the least number with 1 nonprime substring in binary representation.
a(2) = 2, since 2 = 10_2 is the least number with 2 nonprime substrings in binary representation (0 and 1).
a(3) = 7, since 7 = 111_2 is the least number with 3 nonprime substrings in binary representation (3-times 1, the prime substrings are 2-times 11 and 111).
a(10) = 22, since 22 = 10110_2 is the least number with 10 nonprime substrings in binary representation, these are 0, 0, 1, 1, 1, 01, 011, 110, 0110 and 10110 (remember, that substrings with leading zeros are considered to be nonprime).

Hieronymus Fischer, Table of n, a(n) for n = 1..2015

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

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

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

Original entry on oeis.org

2, 1, 12, 9, 83, 84, 81, 748, 740, 731, 729, 6653, 6581, 6563, 6564, 6561, 59222, 59069, 59068, 59051, 59052, 59049, 531614, 531569, 531464, 531460, 531452, 531443, 531441, 4784122, 4783142, 4783147, 4783070, 4782989, 4782971, 4782972, 4782969, 43048283

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} 9^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-9 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-9 representation), m>=d, than b := p*9^(m-d) has m*(m+1)/2 - k nonprime substrings, and a(A000217(n)-k) <= b.

			a(0) = 2, since 2 = 2_9 is the least number with zero nonprime substrings in base-9 representation.
a(1) = 1, since 1 = 1_9 is the least number with 1 nonprime substring in base-9 representation.
a(2) = 12, since 12 = 13_9 is the least number with 2 nonprime substrings in base-9 representation (1 and 13).
a(3) = 9, since 9 = 10_9 is the least number with 3 nonprime substrings in base-9 representation (0, 1 and 10).
a(4) = 83, since 83 = 102_9 is the least number with 4 nonprime substrings in base-9 representation, these are 0, 1, 10, and 02 (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) >= 9^floor((sqrt(8*n-7)-1)/2) for n>0, equality holds if n is a triangular number (cf. A000217).
a(A000217(n)) = 9^(n-1), n>0.
a(A000217(n)-k) >= 9^(n-1) + k, 0<=k0.
a(A000217(n)-k) = 9^(n-1) + p, where p is the minimal number >= 0 such that 9^(n-1) + p, has k prime substrings in base-9 representation, 0<=k0.

A217112 Greatest number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1, 3, 7, 6, 15, 14, 31, 29, 30, 63, 61, 62, 127, 54, 125, 126, 255, 117, 251, 254, 189, 511, 479, 509, 510, 379, 502, 1023, 1021, 1007, 1022, 958, 1018, 1014, 2047, 2045, 1791, 2046, 2042, 2027, 2037, 4091, 4095, 4063, 3069, 4094, 4090, 4085, 8159, 8187, 8191, 8189, 8127

Offset: 1

Hieronymus Fischer, Dec 20 2012

There are no numbers with zero nonprime substrings in binary representation. For all bases > 2 there is always a number (=2) with zero nonprime substrings.

The set of numbers with n nonprime substrings is finite. Proof: Evidently, each 1-digit binary number represents 1 nonprime substring. Hence, each (n+1)-digit number has at least n+1 nonprime substrings. Consequently, there is a boundary b < 2^n, such that all numbers > b have more than n nonprime substrings.

			(1) = 1, since 1 = 1_2 (binary) is the greatest number with 1 nonprime substring.
a(2) = 3 = 11_2 has 3 substrings in binary representation (1, 1 and 11), two of them are nonprime substrings (1 and 1), and 11_2 = 3 is the only prime substrings. 3 is the greatest number with 2 nonprime substrings.
a(8) = 29 = 11101_2 has 15 substrings in binary representation (0, 1, 1, 1, 1, 11, 11, 10, 01, 111, 110, 101, 1110, 1101, 11101), exactly 8 of them are nonprime substrings (0, 1, 1, 1, 1, 01, 110, 1110). There is no greater number with 8 nonprime substrings in binary representation.
a(14) = 54 = 110110_2 has 21 substrings in binary representation, only 7 of them are prime substrings (10, 10, 11, 11, 101, 1011, 1101), which implies that exactly 14 substrings must be nonprime. There is no greater number with 14 nonprime substrings in binary representation.

Hieronymus Fischer, Table of n, a(n) for n = 1..1000

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

a(n) >= A217102(n).
a(n) >= A217302(A000217(A070939(a(n)))-n).
Example: a(9)=30=11110_2, A000217(A070939(31))=15, hence, a(9)>=A217302(15-9)=27.
a(n) <= 2^n.
a(n) <= 2^min(6 + n/6, 20*floor((n+125)/126)).
a(n) <= 64*2^(n/6).
With m := floor(log_2(a(n))) + 1:
a(n+m+1) >= 2*a(n), if a(n) is even.
a(n+m) >= 2*a(n), if a(n) is odd.

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

Original entry on oeis.org

47, 428, 1721, 6473, 14033, 35201, 58961, 58967, 465743, 530701, 530710, 1733741, 4250788, 4723108, 4776398, 25051529, 37327196, 42450640, 42986860, 42987589, 42996409, 225463817, 382055767, 382571822, 386888308, 386888419, 387356789

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} 9^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-9 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 3-digit base-9 number has at least 1 nonprime substring. Hence, each 3(n+1)-digit number has at least n+1 nonprime substrings. Consequently, there is a boundary b < 9^(3n+2) 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) = 47, since 47 = 52_9 (base-9) is the greatest number with zero nonprime substrings in base-9 representation.
a(1) = 428 = 525_9 has 1 nonprime substring in base-9 representation (= 525_9). All the other base-9 substrings (2, 5, 5, 25, 52) are prime substrings. 525_9 is the greatest number with 1 nonprime substring.
a(2) = 1721 = 2322_9 has 10 substrings in base-9 representation, exactly 2 of them are nonprime substrings (22_9 and 23_3=8), and there is no greater number with 2 nonprime substrings in base-9 representation.
a(7) = 58967= 88788_9 has 15 substrings in base-9 representation, exactly 7 of them are nonprime substrings (4-times 8, 2-times 88, and 8788), and there is no greater number with 7 nonprime substrings in base-9 representation.

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

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

a(n) >= A217109(n).
a(n) >= A217309(A000217(num_digits_9(a(n)))-n), where num_digits_9(x)=floor(log_9(x))+1 is the number of digits of the base-9 representation of x.
a(n) <= 9^(n+2).
a(n) <= 9^min(n+2, 6*floor((n+7)/8)).
a(n) <= 9^((3/4)*(n + 3)).
a(n+m+1) >= 9*a(n), where m := floor(log_9(a(n))) + 1.

Showing 1-10 of 49 results. Next

cp's OEIS Frontend

A211685 Prime numbers > 1000 such that all the substrings of length >= 3 are primes (substrings with leading '0' are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A213300 Largest number with n nonprime substrings (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A213321 Minimal prime with n prime substrings (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

A217302 Minimal natural number (in decimal representation) with n prime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217309 Minimal natural number (in decimal representation) with n prime substrings in base-9 representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A213302 Smallest number with n nonprime substrings (Version 1: substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217102 Minimal number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A217112 Greatest number (in decimal representation) with n nonprime substrings in binary representation (substrings with leading zeros are considered to be nonprime).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula