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.

A220694 Irregular table: row n (n>=1) consists of numbers 1..A084556(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4
Offset: 1

Views

Author

Antti Karttunen, Dec 18 2012

Keywords

Comments

The term a(n) tells from which position (one-based, starting from the left hand end of permutation) of the corresponding permutation in A030298 the term A030298(n) should be picked from. Use this (instead of A220663) with programming languages like Maple, which use one-based indexing of arrays and vectors.

Examples

			Rows of this irregular table begin as:
  1;
  1, 2;
  1, 2;
  1, 2, 3;
  1, 2, 3;
  ...
		

Crossrefs

Programs

Formula

a(n) = A220663(n)+1.