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.

A200879 Numbers n such that 10^n - 1 divides 10^(10^100) - 10.

Original entry on oeis.org

1, 3, 9, 11, 33, 41, 99, 101, 123, 251, 271, 303, 369, 451, 753, 813, 909, 1111, 1353, 2259, 2439, 2761, 2981, 3333, 3541, 4059, 4141, 5051, 8283, 8943, 9091, 9999, 10291, 10623, 11111, 12423, 15153, 21401, 24849, 25351, 25601, 26829, 27273, 27371, 27961
Offset: 1

Views

Author

Arkadiusz Wesolowski, Nov 23 2011

Keywords

Crossrefs

A200861 is a subsequence.

Programs

  • Mathematica
    Prepend[Select[Range[3, 3000, 2], PowerMod[10, 10^100, 10^# - 1] == 10 &], 1]

A200924 Successive prime factors of 10^(10^100) - 10.

Original entry on oeis.org

2, 3, 3, 3, 3, 5, 37, 67, 83, 199, 397, 1231, 1627, 2707, 3637, 4519, 21649, 30307, 34849, 51203, 52711, 54547, 56369, 97561, 115963, 123493, 136043, 139987, 149077, 173923, 199999, 200003, 333667, 370477, 513239, 538987, 666733, 770437, 943081, 1466653
Offset: 1

Views

Author

Arkadiusz Wesolowski, Nov 24 2011

Keywords

Crossrefs

Programs

  • Mathematica
    Join[{2, 3, 3, 3, 3, 5}, Select[Prime[Range[7^6]], PowerMod[10, 10^100, #] == 10 &]]
Showing 1-2 of 2 results.