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.

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

Table of values

n a(n)
3 0
4 2
5 6
6 19
7 0
8 420
9 924
10 3672
11 0
12 78880
13 431493
14 2173950
15 0
16 71583429
17 436726936
18 2750336517
19 0
20 120521201887
21 833996387274
22 5932255141224
23 0
24 324116744376715
25 2483526997445916
26 19463766853506024
27 0
28 1274294107710603710
29 10627079743009611713
30 90335862784009245081
31 0

List of values

[0, 2, 6, 19, 0, 420, 924, 3672, 0, 78880, 431493, 2173950, 0, 71583429, 436726936, 2750336517, 0, 120521201887, 833996387274, 5932255141224, 0, 324116744376715, 2483526997445916, 19463766853506024, 0, 1274294107710603710, 10627079743009611713, 90335862784009245081, 0]