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.

Showing 1-1 of 1 results.

A152085 a(n) = A152084(n) + 2^floor(log_2(A152084(n))).

Original entry on oeis.org

5, 11, 19, 47, 73, 79, 131, 137, 167, 173, 191, 277, 307, 367, 379, 563, 569, 587, 593, 653, 677, 719, 743, 1033, 1069, 1129, 1153, 1171, 1213, 1231, 1321, 1399, 1423, 1453, 1459, 1483, 1489, 1531, 2063, 2087, 2111, 2141, 2153, 2237, 2273, 2351, 2423, 2447
Offset: 1

Views

Author

Leroy Quet, Nov 23 2008

Keywords

Comments

Every term is prime.
If a(n) is written in binary, then the leftmost 2 digits are "10". If the leftmost "10" is replaced with "1", then we would have the binary representation of A152084(n), which is a prime.

Links

Crossrefs

A152084

Programs

  • Maple
    filter:= n -> isprime(n) and isprime(n + 2^ilog2(n)):
map(t -> t + 2^ilog2(t), select(filter, [seq(i,i=3..10000,2)])); # Robert Israel, Mar 14 2024

Extensions

Extended by Ray Chandler, Nov 26 2008
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.