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.

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

Table of values

n a(n)
2 0
3 0
4 5
5 0
6 79
7 0
8 650
9 2716
10 17846
11 0
12 277166
13 1472993
14 8233003
15 0
16 286485314
17 1797613432
18 11675780880
19 0
20 538954048563
21 3821844010905
22 27824692448867
23 0
24 1587841473665581
25 12417635018180828
26 99246128296767625
27 0
28 6742930364132819544
29 57228575814672196977
30 494789896551823383745
31 0
32 38997607084561562847324

List of values

[0, 0, 5, 0, 79, 0, 650, 2716, 17846, 0, 277166, 1472993, 8233003, 0, 286485314, 1797613432, 11675780880, 0, 538954048563, 3821844010905, 27824692448867, 0, 1587841473665581, 12417635018180828, 99246128296767625, 0, 6742930364132819544, 57228575814672196977, 494789896551823383745, 0, 38997607084561562847324]