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.

A346562 Irregular triangle read by rows in which row n lists the first n - 2 terms of A000005 together with the sum of A000005(n-1) and A000005(n), with a(1) = 1.

Original entry on oeis.org

1, 3, 1, 4, 1, 2, 5, 1, 2, 2, 5, 1, 2, 2, 3, 6, 1, 2, 2, 3, 2, 6, 1, 2, 2, 3, 2, 4, 6, 1, 2, 2, 3, 2, 4, 2, 7, 1, 2, 2, 3, 2, 4, 2, 4, 7, 1, 2, 2, 3, 2, 4, 2, 4, 3, 6, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 8, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 8, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 6
Offset: 1

Views

Author

Omar E. Pol, Jul 23 2021

Keywords

Comments

T(n,k) is the total number of divisors related to the terraces that are in the k-th level that contains terraces starting from the base of the symmetric tower described in A221529.

Examples

			Triangle begins:
1;
3;
1, 4;
1, 2, 5;
1, 2, 2, 5;
1, 2, 2, 3, 6;
1, 2, 2, 3, 2, 6;
1, 2, 2, 3, 2, 4, 6;
1, 2, 2, 3, 2, 4, 2, 7;
1, 2, 2, 3, 2, 4, 2, 4, 7;
1, 2, 2, 3, 2, 4, 2, 4, 3, 6;
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 8;
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 8;
1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 6, 6;
...
		

Crossrefs

The length of row n is A028310(n-1).
Row sums give A006218, n >= 1.
Leading diagonal gives A092405.
Other diagonals give A000005.
Column 1 gives the absolute values of A260196.
Companion of A346533.