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.

A145382 Write the n-th prime in binary. Change all 0's to 1's and all 1's to 0's. a(n) is the decimal equivalent of the result.

Original entry on oeis.org

1, 0, 2, 0, 4, 2, 14, 12, 8, 2, 0, 26, 22, 20, 16, 10, 4, 2, 60, 56, 54, 48, 44, 38, 30, 26, 24, 20, 18, 14, 0, 124, 118, 116, 106, 104, 98, 92, 88, 82, 76, 74, 64, 62, 58, 56, 44, 32, 28, 26, 22, 16, 14, 4, 254, 248, 242, 240, 234, 230, 228, 218, 204, 200, 198, 194, 180, 174
Offset: 1

Views

Author

Leroy Quet, Oct 09 2008

Keywords

Comments

a(n) = A035327(p(n)), where p(n) is the n-th prime.

Crossrefs

A171008 gives the binary expansions. Cf. A035327.

Programs

  • Maple
    f:=proc(n) options operator, arrow: 2^(1+floor(log[2](n)))-n-1 end proc: seq(f(ithprime(n)),n=1..71); # Emeric Deutsch, Oct 19 2008

Formula

a(n)=2^{1+floor(log[2](p(n)))}-n-1, where p(n) is the n-th prime. - Emeric Deutsch, Oct 19 2008

Extensions

Extended by Emeric Deutsch, Oct 19 2008