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.

A154234 Triangle read by rows: T(n,k) = (n mod d(k)), where d(i) is the number of divisors of i.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 0, 0, 0, 2, 0, 1, 1, 1, 1, 3, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 2, 0, 2, 1, 2, 0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Nov 26 2010

Keywords

Examples

			The first few rows are given by:
0.
0 0.
0 1 1.
0 0 0 1.
0 1 1 2 1.
0 0 0 0 0 2.
0 1 1 1 1 3 1.
0 0 0 2 0 0 0 0.
0 1 1 0 1 1 1 1 0.
0 0 0 1 0 2 0 2 1 2.- _G. C. Greubel_, Sep 06 2016
		

Crossrefs

Cf. A000005.

Programs