A330970 For any number n >= 0 with decimal digits (d_1, d_2, ..., d_k), the decimal expansion of a(n) is (n mod (1+d_1), n mod (1+d_2), ..., n mod (1+d_k)).

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 0, 11, 4, 13, 2, 11, 0, 19, 20, 1, 11, 23, 4, 11, 25, 3, 11, 29, 20, 31, 2, 11, 24, 35, 1, 15, 22, 39, 0, 11, 20, 33, 44, 3, 14, 27, 33, 49, 20, 31, 41, 51, 4, 11, 20, 31, 44, 59, 40, 51, 62, 3, 14, 25, 33, 43, 55, 69, 60

Offset

0,3

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Formula

a(n) <= n with equality iff n belongs to A330969.

a(n) = 0 iff n belongs to A330971.

Example

For n = 42:
- 42 mod (1+4) = 2,
- 42 mod (1+2) = 0,
- hence a(42) = 20.

Prog

(PARI) a(n) = fromdigits(apply(d -> n%(d+1), digits(n)))

Crossrefs

Cf. A330969 (fixed points), A330971 (indices of zeros).

Sequence in context: A349278 A195833 A257294 * A139281 A059707 A256754

Adjacent sequences: A330967 A330968 A330969 * A330971 A330972 A330973

Keyword

nonn,base,look

Author

Rémy Sigrist, Jan 05 2020

Status

approved