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.

A372249 The smallest number k which, when written in base n, has a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together contain the digits 0,1,...,(n-1) exactly once. Set a(n) = -1 if no such k exists.

Table of values

n a(n)
7 297
8 440
9 1440
10 8596
11 15552
12 121638
13 282240
14 1039104
15 5757696
16 24108000

List of values

[297, 440, 1440, 8596, 15552, 121638, 282240, 1039104, 5757696, 24108000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.