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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A375111 a(n) = A375110(n) mod A375110(n+1). 2
0, 1, 0, 2, 0, 3, 1, 3, 1, 0, 4, 0, 5, 2, 4, 1, 5, 2, 5, 2, 0, 6, 1, 6, 1, 0, 7, 0, 8, 3, 6, 2, 7, 1, 8, 3, 7, 2, 8, 4, 7, 3, 8, 4, 8, 4, 0, 9, 1, 9, 2, 9, 3, 9, 3, 0, 10, 1, 10, 2, 10, 2, 0, 11, 1, 11, 1, 0, 12, 0, 13, 5, 9, 4, 10, 3, 11, 2, 12, 1, 13, 5, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Rémy Sigrist, PARI program
EXAMPLE
a(42) = A375110(42) mod A375110(43) = 11 mod 8 = 3.
PROG
(PARI) \\ See Links section.
CROSSREFS
Cf. A375110.
Sequence in context: A336916 A082650 A054875 * A324115 A029239 A162201
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jul 30 2024
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 12 19:14 EDT 2024. Contains 375853 sequences. (Running on oeis4.)