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.

A343825 Table read by antidiagonals upward: T(n,k) is the least m such that there exists a sequence k = b_1 <= b_2 <= ... <= b_t = m such that no term appears n or more times and the product of the sequence is of the form c^n, where c is an integer; n >= 1 and k >= 0.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 2
7 0
8 1
9 6
10 3
11 0
12 1
13 4
14 8
15 4
16 0
17 1
18 4
19 6
20 4
21 5
22 0
23 1
24 4
25 6
26 9
27 10
28 6
29 0
30 1
31 4
32 6
33 4
34 10
35 12
36 7
37 0
38 1
39 4
40 6
41 8
42 10
43 12
44 14
45 8
46 0
47 1
48 4
49 6
50 4
51 10
52 9
53 14
54 15
55 9
56 0
57 1
58 4
59 6
60 8
61 10
62 9
63 14
64 8
65 9
66 10
67 0
68 1
69 4
70 6
71 4
72 10
73 12
74 14
75 15
76 16
77 18
78 11
79 0
80 1
81 4

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 6, 3, 0, 1, 4, 8, 4, 0, 1, 4, 6, 4, 5, 0, 1, 4, 6, 9, 10, 6, 0, 1, 4, 6, 4, 10, 12, 7, 0, 1, 4, 6, 8, 10, 12, 14, 8, 0, 1, 4, 6, 4, 10, 9, 14, 15, 9, 0, 1, 4, 6, 8, 10, 9, 14, 8, 9, 10, 0, 1, 4, 6, 4, 10, 12, 14, 15, 16, 18, 11, 0, 1, 4]