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.

Showing 1-2 of 2 results.

A277904 Irregular table: row n (n >= 0) is obtained by listing numbers 0 .. A018819(n)-1.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19
Offset: 1

Views

Author

Antti Karttunen, Nov 14 2016

Keywords

Examples

			A018819 -> range -> terms on row n
  1        [0,0]:    0;
  1        [0,0]:    0;
  2        [0,1]:    0, 1;
  2        [0,1]:    0, 1;
  4        [0,3]:    0, 1, 2, 3;
  4        [0,3]:    0, 1, 2, 3;
  6        [0,5]:    0, 1, 2, 3, 4, 5;
etc.
		

Crossrefs

Used for constructing A277905.
Retaining only every second row gives A278164.

Programs

Formula

a(1) = 0; for n > 1, a(n) = n - A000123(A277903(n)-1) - 1.

A278163 a(n) = the least k such that A131205(1+k) >= n; each n occurs A000123(n) times.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Nov 15 2016

Keywords

Comments

Greatest monotonic left inverse of A131205(1+n).

Crossrefs

Programs

Formula

a(A131205(1+n)) = n.
Showing 1-2 of 2 results.