A276570 a(n) = n modulo ludic factor of n: n mod A272565(n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0

Offset

1,19

Links

Antti Karttunen, Table of n, a(n) for n = 1..8008

Index entries for sequences generated by sieves

Formula

a(n) = n mod A272565(n).

Prog

(Scheme) (define (A276570 n) (modulo n (A272565 n)))

Crossrefs

Cf. A003309, A272565, A276580 (computed for each term of array A255127).

Cf. A276568 (positions of zeros), A276569 (of nonzeros).

Sequence in context: A217511 A307380 A178990 * A360543 A236378 A341880

Adjacent sequences: A276567 A276568 A276569 * A276571 A276572 A276573

Keyword

nonn

Author

Antti Karttunen, Sep 13 2016

Status

approved