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.

A255573 a(n) = Number of terms of A205783 (including 1) in range 0 .. n.

Original entry on oeis.org

0, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, 11, 12, 13, 14, 14, 15, 15, 16, 17, 18, 18, 19, 19, 20, 21, 22, 23, 24, 24, 25, 26, 27, 27, 28, 28, 29, 30, 31, 31, 32, 33, 34, 35, 36, 36, 37, 37, 38, 39, 40, 40, 41, 41, 42, 43, 44, 45, 46, 46, 47, 47, 48, 48, 49, 49, 50, 51, 52, 52
Offset: 0

Views

Author

Antti Karttunen, May 14 2015

Keywords

Crossrefs

Essentially one more than A255572 (after the initial zero).

Programs

  • PARI
    A255573_write_bfile(up_to_n) = { my(n,a_n=0); for(n=0, up_to_n, if(((n > 0) && !polisirreducible(Pol(binary(n)))),a_n++); write("b255573.txt", n, " ", a_n)); };
    A255573_write_bfile(8192);

Formula

a(n) = n - A255574(n).
Other identities and observations. For all n >= 1:
a(n) = 1 + A255572(n).
a(n) <= A062298(n).