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.

A076099 Triangle read by rows in which the n-th row contains n numbers not occurring in the previous rows whose product is an n-th power. The first (n-1) numbers of the n-th row are the smallest number not occurring earlier and the n-th term is chosen to satisfy the requirement.

Table of values

n a(n)
1 1
2 2
3 8
4 3
5 4
6 18
7 5
8 6
9 7
10 9261000
11 9
12 10
13 11
14 12
15 329422500
16 13
17 14
18 15
19 16
20 17
21 13456677968449745006250
22 19
23 20
24 21
25 22
26 23
27 24
28 11022732501667945875061568782593750
29 25
30 26
31 27
32 28
33 29
34 30
35 31

List of values

[1, 2, 8, 3, 4, 18, 5, 6, 7, 9261000, 9, 10, 11, 12, 329422500, 13, 14, 15, 16, 17, 13456677968449745006250, 19, 20, 21, 22, 23, 24, 11022732501667945875061568782593750, 25, 26, 27, 28, 29, 30, 31]