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.

A218169 Smallest prime with power closest to having n copies of each digit, with one fewer of 1, 2, 4, 5, 7 or 8.

Original entry on oeis.org

2, 1084357, 558017, 40844333, 9717439, 205807697, 316363037, 14326787, 106741703, 931524977, 227145983, 7031729687, 7284563827, 52156681, 7914854663
Offset: 1

Views

Author

James G. Merickel, Oct 22 2012

Keywords

Comments

The powers for the terms so far are 29, 3, 5, 5, 7, 7, 8, 11, 11, 11, 13, 12, 13, 18 and 15. A218170 is the opposing sequence with an extra copy of some digit. The 3-divisibility criterion precludes all digits appearing equally frequently. A217368 deals with the case not limited to primes.

Examples

			2^29 = 536870912, missing a copy of the digit 4.
		

Crossrefs