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.

Previous Showing 11-11 of 11 results.

A374921 Irregular triangle read by rows: T(n,k), n >= 0, k >= 1, in which if n is even then row n lists the first A008619(n) even indexed terms of A027336 otherwise if n is odd then row n lists the first A008619(n) odd indexed terms of A027336.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 2, 4, 1, 1, 3, 6, 1, 2, 4, 8, 1, 1, 3, 6, 11, 1, 2, 4, 8, 15, 1, 1, 3, 6, 11, 20, 1, 2, 4, 8, 15, 26, 1, 1, 3, 6, 11, 20, 35, 1, 2, 4, 8, 15, 26, 45, 1, 1, 3, 6, 11, 20, 35, 58, 1, 2, 4, 8, 15, 26, 45, 75, 1, 1, 3, 6, 11, 20, 35, 58, 96, 1, 2, 4, 8, 15, 26, 45, 75, 121
Offset: 0

Views

Author

Omar E. Pol, Aug 01 2024

Keywords

Comments

The sum of row n equals the number of partitions of n.

Examples

			Triangle begins:
  1;
  1;
  1, 1;
  1, 2;
  1, 1, 3;
  1, 2, 4;
  1, 1, 3, 6;
  1, 2, 4, 8;
  1, 1, 3, 6, 11;
  1, 2, 4, 8, 15;
  1, 1, 3, 6, 11, 20;
  1, 2, 4, 8, 15, 26;
  1, 1, 3, 6, 11, 20, 35;
  1, 2, 4, 8, 15, 26, 45;
  1, 1, 3, 6, 11, 20, 35, 58;
  1, 2, 4, 8, 15, 26, 45, 75;
  1, 1, 3, 6, 11, 20, 35, 58, 96;
  1, 2, 4, 8, 15, 26, 45, 75, 121;
  ...
For n = 10 the sum of the 10th row is 1 + 1 + 3 + 6 + 11 + 20 = 42, the same as the number of partitions of 10.
		

Crossrefs

Row sums give A000041.
Row lengths give A008619.
Right border gives A027336.
Columns 1..4: A000012, A000034, A010702, A010724.
Previous Showing 11-11 of 11 results.