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-2 of 2 results.

A236320 Conjectured number of Sierpiński numbers less than 10^n.

Original entry on oeis.org

0, 0, 0, 0, 1, 11, 69, 677, 6709
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jan 22 2014

Keywords

Links

Crossrefs

Cf. A076336, A236321, A237880.

Formula

a(n) ~ A236321(n).

A237880 Conjectured number of distinct integers < 10^n that are Sierpiński or Riesel or simultaneously Sierpiński and Riesel numbers.

Original entry on oeis.org

0, 0, 0, 0, 1, 16, 134, 1345, 13420
Offset: 1

Views

Author

Arkadiusz Wesolowski, Feb 14 2014

Keywords

Links

Crossrefs

Cf. A076335, A076336, A076337, A101036, A236320, A236321.

Formula

a(n) = A236320(n) + A236321(n) for n <= 9.

Extensions

Definition clarified by Arkadiusz Wesolowski, Jun 05 2021
Showing 1-2 of 2 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.