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.

A381266 a(n) = least positive integer m such that when m*(m+1) is written in base n, it contains every single digit exactly once, or 0 if no such number exists.

Table of values

n a(n)
2 1
3 0
4 12
5 34
6 134
7 0
8 1477
9 6891
10 38627
11 0
12 891230
13 4874690
14 28507439
15 0
16 1078575795
17 7002987575
18 46916000817
19 0
20 2295911609450
21 16720559375850
22 124852897365573
23 0
24 7468470450367652
25 59705969514613035
26 487357094495846175
27 0
28 34452261762372201726
29 297930994005481958694

List of values

[1, 0, 12, 34, 134, 0, 1477, 6891, 38627, 0, 891230, 4874690, 28507439, 0, 1078575795, 7002987575, 46916000817, 0, 2295911609450, 16720559375850, 124852897365573, 0, 7468470450367652, 59705969514613035, 487357094495846175, 0, 34452261762372201726, 297930994005481958694]