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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283497 Remainder when n is divided by A004074(n), or -1 if A004074(n) = 0. 1
 0, -1, 0, -1, 0, 0, 0, -1, 0, 0, 2, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, 2, 3, 0, 0, 2, 0, 0, 2, 0, 0, -1, 0, 0, 2, 0, 2, 2, 4, 4, 6, 0, 1, 4, 3, 6, 5, 0, 0, 2, 2, 4, 4, 0, 6, 2, 2, 2, 4, 0, 1, 0, 0, -1, 0, 0, 1, 0, 4, 4, 1, 0, 3, 2, 3, 4, 5, 8, 2, 0, 4, 10, 6, 0, 8, 6, 10, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 LINKS Altug Alkan, Table of n, a(n) for n = 1..10000 Altug Alkan, Illustration of A283497 FORMULA a(2^n) = -1 for n > 0. EXAMPLE a(11) = 2 because remainder when 11 is divided by A004074(11) = 3 is 2. CROSSREFS Cf. A004001, A004074. Sequence in context: A260162 A123858 A193261 * A265507 A035145 A244315 Adjacent sequences: A283494 A283495 A283496 * A283498 A283499 A283500 KEYWORD sign AUTHOR Altug Alkan, Mar 11 2017 STATUS approved

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

Last modified September 18 09:45 EDT 2024. Contains 375999 sequences. (Running on oeis4.)