A078826 -id:A078826 - cp's OEIS frontend

A146526 a(n) = the smallest positive integer m with exactly n (no more, no fewer) distinct primes represented in binary as substrings within the binary representation of m.

1, 2, 5, 14, 11, 27, 23, 47, 59, 119, 189, 239, 379, 503, 479, 959, 991, 1919, 2015, 3067, 3967, 5087, 8063, 8159, 13279, 16319, 24543, 29663, 46047, 62431, 63439, 98139, 119775, 171999, 196443, 229199, 245671, 368607, 439263, 507815, 491343, 522191, 916799, 982687, 1044383, 2064207, 2031263

Offset: 0

Leroy Quet, Oct 30 2008

nonn

a(n) = the smallest positive integer m such that A078826(m) = n.

Cf. A078826.

a(8)-a(38) from Ray Chandler, Nov 06 2008

More terms from Sean A. Irvine, Jan 13 2011

A146527 a(n) = number of distinct composites, when each is represented in binary, that occur as substrings within the binary representation of n.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 2, 2, 1, 0, 3, 1, 2, 1, 3, 2, 3, 2, 3, 2, 2, 0, 5, 5, 3, 2, 5, 2, 4, 1, 4, 4, 3, 3, 4, 3, 4, 3, 5, 4, 3, 2, 5, 3, 3, 1, 7, 6, 7, 6, 6, 4, 4, 3, 8, 8, 5, 3, 8, 4, 5, 2, 5, 5, 5, 4, 4, 4, 5, 3, 6, 4, 5, 4, 6, 5, 6, 4, 7, 6, 6, 4, 6, 4, 5, 3, 8, 7, 6, 5, 7, 4, 5, 2, 9, 8, 8, 8, 9, 7, 8, 7, 9, 8

Offset: 1

Leroy Quet, Oct 30 2008

nonn

a(n) = 0 for n equal to only the positive integers 1,2,3,5,7,11,23 (sequence A048278).

			20 in binary is 10100. The composites, when represented in binary, that can be found within 10100 are 4 = 100 in binary, 10 (decimal) = 1010 in binary and 20 itself = 10100 in binary. There are 3 of these composites, so a(20) = 3.

A078826

Extended by Ray Chandler, Nov 03 2008

cp's OEIS Frontend

A146526 a(n) = the smallest positive integer m with exactly n (no more, no fewer) distinct primes represented in binary as substrings within the binary representation of m.

Views

Author

Keywords

Comments

Crossrefs

Extensions