A123522 -id:A123522 - cp's OEIS frontend

A180160 (sum of digits) mod (number of digits) of n in decimal representation.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 1, 2

Offset: 0

Reinhard Zumkeller, Aug 15 2010

a(n) = A007953(n) mod A055642(n);
a(A061383(n)) = 0; a(A180157(n)) > 0;
a(repdigits)=0: a(A010785(n))=0: a(A002275(n))=0: a(A002276(n))=0: a(A002277(n))=0: a(A002278(n))=0: a(4(n))=0: a(A002279(n))=0: a(A002280(n))=0: a(A002281(n))=0: a(A002282(n))=0: a(A002283(n))=0;
A123522 gives smallest m such that a(m) = n.

Reinhard Zumkeller, Table of n, a(n) for n = 0..25000

Cf. A002275-A002283, A007953, A010785, A055642, A061383, A123522, A180157, A374097.

A180160[n_] := If[n == 0, 0, Mod[Total[#], Length[#]] & [IntegerDigits[n]]];
Array[A180160, 100, 0] (* Paolo Xausa, Jun 30 2024 *)
Join[{0},Table[Mod[Total[IntegerDigits[n]],IntegerLength[n]],{n,110}]] (* Harvey P. Dale, Jul 30 2025 *)

cp's OEIS Frontend

A180160 (sum of digits) mod (number of digits) of n in decimal representation.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica