login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276570 a(n) = n modulo ludic factor of n: n mod A272565(n). 4
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 (list; graph; refs; listen; history; text; internal format)
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 * A236378 A341880 A308426

Adjacent sequences:  A276567 A276568 A276569 * A276571 A276572 A276573

KEYWORD

nonn

AUTHOR

Antti Karttunen, Sep 13 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:49 EDT 2021. Contains 343072 sequences. (Running on oeis4.)