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.

A278028 Let {c(i)} = A007916 denote the sequence of numbers > 1 which are not perfect powers. Every positive integer n has a unique representation as a tower n = c(x_1)^c(x_2)^c(x_3)^...^c(x_k), where the exponents are nested from the right. The sequence is an irregular triangle read by rows, where the n-th row lists x_1, ..., x_k.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane, Nov 09 2016

Keywords

Comments

Row lengths are A288636(n). - Gus Wiseman, Jun 12 2017

Examples

			Rows 2 through 32 are:
1,
2,
1, 1,
3,
4,
5,
1, 2,
2, 1,
6,
7,
8,
9,
10,
11,
1, 1, 1,
12,
13,
14,
15,
16,
17,
18,
19,
3, 1,
20,
2, 2,
21,
22,
23,
24,
1, 3,
...
		

Crossrefs

See A277564 for another version.