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.

A091801 Largest n-digit multiple of the n-th prime.

Original entry on oeis.org

8, 99, 995, 9996, 99990, 999999, 9999995, 99999983, 999999980, 9999999994, 99999999981, 999999999999, 9999999999984, 99999999999964, 999999999999960, 9999999999999954, 99999999999999992, 999999999999999959
Offset: 1

Views

Author

Amarnath Murthy, Feb 21 2004

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Prime[n] Floor[(10^n-1)/Prime[n]],{n,20}] (* Harvey P. Dale, Jun 06 2023 *)

Extensions

More terms from Ray Chandler, Feb 22 2004

A091803 (Smallest n-digit multiple of the n-th prime) - 10^(n-1).

Original entry on oeis.org

1, 2, 0, 1, 10, 9, 8, 4, 21, 11, 26, 11, 23, 5, 43, 6, 11, 2, 53, 52, 1, 17, 2, 10, 22, 91, 89, 63, 106, 76, 95, 25, 136, 6, 96, 149, 111, 67, 51, 56, 35, 105, 106, 34, 127, 11, 10, 202, 5, 182, 28, 139, 187, 4, 135, 23, 170, 171, 40, 124, 39, 123, 188, 251, 171, 123, 207, 87
Offset: 1

Views

Author

Amarnath Murthy, Feb 21 2004

Keywords

Crossrefs

a(n) = A079821(n) - 10^(n-1).

Extensions

Corrected and extended by Ray Chandler, Feb 22 2004
Showing 1-2 of 2 results.