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.

A137248 The smallest prime with digit sum n and maximum digit product (or 0 if no such prime exists).

Original entry on oeis.org

2, 3, 13, 23, 0, 43, 233, 0, 433, 2333, 0, 3343, 23333, 0, 33343, 323333, 0, 333433, 3233333, 0, 3333433, 32333333, 0, 34333333, 333233333, 0, 333334333, 3233333333, 0, 3334333333, 23333333333, 0, 33333333343, 333332333333, 0, 333333343333
Offset: 2

Views

Author

Lekraj Beedassy, Mar 10 2008

Keywords

Comments

Conjecture: If n > 4 and a(n) > 0, then a(n) consists only of the digits 2, 3 and 4. - Chai Wah Wu, Dec 17 2015

Crossrefs

Cf. A083178.