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

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,14

Links

G. C. Greubel, Table of n, a(n) for the first 50 rows

Example

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

Mathematica

Table[Mod[n, DivisorSigma[0, k]], {n, 20}, {k, n}]//Flatten (* Harvey P. Dale, Jul 21 2016 *)

Prog

(PARI) T(n, k)=n%numdiv(k) \\ Charles R Greathouse IV, Sep 07 2016

Crossrefs

Cf. A000005.

Sequence in context: A017867 A127843 A350750 * A091396 A173677 A219480

Adjacent sequences: A154231 A154232 A154233 * A154235 A154236 A154237

Keyword

nonn,tabl,easy

Author

Juri-Stepan Gerasimov, Nov 26 2010

Status

approved