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

A218170 Smallest prime with power closest to having all digits n times, with one more of 1, 2, 4, 5, 7 or 8.

Original entry on oeis.org

101723, 4697081, 1361471, 5772427, 18168923, 35514203, 562489981, 780433519, 1006447529, 228344981, 10187739647, 1951104049, 496920113, 2246645239, 2596274977, 10431345763, 2862382343
Offset: 1

Views

Author

James G. Merickel, Oct 22 2012

Keywords

Comments

Like A218169 but with an extra copy, rather than one less copy, of some digit. The exponents here are 2, 3, 5, 6, 7, 8, 8, 9, 10, 12, 11, 13, 15, 15, 16, 16 and 18. A217368 holds the sequence for powers of composites -- necessarily -- with equal counts of all digits.

Examples

			Unlike the parallel sequence, with 2^29 being a digit shy of having exactly  one of each digit, the smallest prime to have a power with two copies of some digit and one of all others is 101723, whose square is 10347568729.

Crossrefs

Cf. A218169, A217368.
Showing 1-1 of 1 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.