A180160 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A180160

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

7

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,102

COMMENTS

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.

LINKS

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

MATHEMATICA

A180160[n_] := If[n == 0, 0, Mod[Total[#], Length[#]] & [IntegerDigits[n]]];

Array[A180160, 100, 0] (* Paolo Xausa, Jun 30 2024 *)

CROSSREFS

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

Sequence in context: A225094 A350594 A295859 * A101661 A322989 A322823

Adjacent sequences: A180157 A180158 A180159 * A180161 A180162 A180163

KEYWORD

base,nonn

AUTHOR

Reinhard Zumkeller, Aug 15 2010

STATUS

approved