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.

A382054 a(n) = least positive integer m such that when m*(m+1) is written in base n, it does not contain the digit n-1 and contains every single digit from 0 to n-2 exactly once, or 0 if no such number exists.

Table of values

n a(n)
3 0
4 0
5 14
6 54
7 0
8 616
9 2251
10 12069
11 0
12 251085
13 1348305
14 7619403
15 0
16 269717049
17 1698727527
18 11061795398
19 0
20 513383208454
21 3648738866370
22 26618719297968
23 0
24 1524495582671125
25 11941193897016731
26 95578593301936475
27 0
28 6510865478836888683
29 55324396705324796861
30 478855818873249715068
31 0
32 37817609915967014967822

List of values

[0, 0, 14, 54, 0, 616, 2251, 12069, 0, 251085, 1348305, 7619403, 0, 269717049, 1698727527, 11061795398, 0, 513383208454, 3648738866370, 26618719297968, 0, 1524495582671125, 11941193897016731, 95578593301936475, 0, 6510865478836888683, 55324396705324796861, 478855818873249715068, 0, 37817609915967014967822]