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.

A011784 Levine's sequence. First construct a triangle as follows. Row 1 is {1,1}; if row n is {r_1, ..., r_k} then row n+1 consists of {r_k 1's, r_{k-1} 2's, r_{k-2} 3's, etc.}; sequence consists of the final elements in each row.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 7
7 14
8 42
9 213
10 2837
11 175450
12 139759600
13 6837625106787
14 266437144916648607844
15 508009471379488821444261986503540
16 37745517525533091954736701257541238885239740313139682
17 5347426383812697233786139576220450142250373277499130252554080838158299886992660750432

List of values

[1, 2, 2, 3, 4, 7, 14, 42, 213, 2837, 175450, 139759600, 6837625106787, 266437144916648607844, 508009471379488821444261986503540, 37745517525533091954736701257541238885239740313139682, 5347426383812697233786139576220450142250373277499130252554080838158299886992660750432]