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.

Previous Showing 21-23 of 23 results.

A213317 Numbers with exactly 10 nonprime substrings (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

1000, 1001, 1004, 1006, 1008, 1040, 1044, 1046, 1048, 1060, 1064, 1066, 1068, 1080, 1081, 1084, 1086, 1088, 1400, 1404, 1406, 1408, 1440, 1444, 1446, 1448, 1460, 1464, 1466, 1468, 1469, 1480, 1484, 1486, 1488, 1600
Offset: 1

Views

Author

Hieronymus Fischer, Aug 26 2012

Keywords

Comments

The sequence is finite. Proof: Each 9-digit number has at least 15 nonprime substrings. Thus, each number with more than 9 digits has >= 15 nonprime substrings, too. Consequently, there is a boundary b<10^9, such that all numbers > b have more than 10 nonprime substrings.
The first term is a(1)=1000=A213302(10). The last term is a(20230)=37337397=A213300(10).

Examples

			a(1)=1000, since 1000 has 10 nonprime substrings (0, 0, 0, 1, 00, 00, 10, 000, 100, 1000).
a(20230)= 37337397, since there are 10 nonprime substrings (9, 33, 39, 7337, 7397, 73373, 373373, 733739, 7337397, 37337397).
		

Crossrefs

A213318 Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

10037, 10103, 10111, 10117, 10123, 10127, 10130, 10134, 10136, 10138, 10151, 10153, 10157, 10159, 10163, 10167, 10171, 10172, 10175, 10191, 10192, 10195, 10199, 10213, 10217, 10227, 10229, 10231, 10232, 10235, 10239, 10243
Offset: 1

Views

Author

Hieronymus Fischer, Aug 26 2012

Keywords

Comments

The sequence is finite. Proof: Each 9-digit number has at least 15 nonprime substrings. Thus, each number with more than 9 digits has >= 15 nonprime substrings, too. Consequently, there is a boundary b<10^9, such that all numbers > b have more than 11 nonprime substrings.
The first term is a(1)=10037=A213302(11). The last term is a(32869)=82337397=A213300(11).

Examples

			a(1)= 10037, since 10037 has 11 nonprime substrings (0, 0, 1, 00, 03, 10, 003, 037, 100, 0037, 1003).
a(32869)= 82337397, since there are 11 nonprime substrings (8, 9, 33, 39, 82, 2337, 7397, 23373, 82337, 233739, 82337397).
		

Crossrefs

A213319 Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).

Original entry on oeis.org

10023, 10053, 10067, 10073, 10079, 10093, 10097, 10107, 10112, 10115, 10119, 10122, 10125, 10129, 10141, 10143, 10147, 10152, 10155, 10170, 10174, 10176, 10178, 10181, 10183, 10190, 10194, 10196, 10198, 10212, 10215, 10219
Offset: 1

Views

Author

Hieronymus Fischer, Aug 26 2012

Keywords

Comments

The sequence is finite. Proof: Each 9-digit number has at least 15 nonprime substrings. Thus, each number with more than 9 digits has >= 15 nonprime substrings, too. Consequently, there is a boundary b<10^9, such that all numbers > b have more than 12 nonprime substrings.
The first term is a(1)=10023=A213302(12). The last term is a(51477)=99733313=A213300(12).

Examples

			a(1)=10023, since 10023 has 12 nonprime substrings (0, 0, 1, 00, 02, 10, 002, 023, 100, 0023, 1002, 10023).
a(51477)=99733313, since there are 11 nonprime substrings (1, 9, 9, 33, 33, 99, 333, 973, 33313, 97333, 733313, 99733313).
		

Crossrefs

Previous Showing 21-23 of 23 results.