The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121559 Final result (0 or 1) under iterations of {r mod (max prime p <= r)} starting at r = n. 10
 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Previous name: Find r1 = n modulo p1, where p1 is the largest prime not greater than n. Then find r2 = r1 modulo p2, where p2 is the largest prime not greater than r1. Repeat until the last r is either 1 or 0; a(n) is the last r value. The sequence has the form of blocks of 0's between 1's. See sequence A121560 for the lengths of the blocks of zeros. The function r mod (max prime p <= r), which appears in the definition, equals r - (max prime p <= r) = A064722(r), because p <= r < 2*p by Bertrand's postulate, where p is the largest prime less than or equal to r. - Pontus von Brömssen, Jul 31 2022 LINKS Kerry Mitchell, Table of n, a(n) for n = 1..7919 FORMULA a(p) = 0 when p is prime. - Michel Marcus, Aug 22 2014 a(n) = A175077(n+1) - 1. - Pontus von Brömssen, Jul 31 2022 a(n) = A200947(n) mod 2. - Alois P. Heinz, Jun 12 2023 EXAMPLE a(9) = 0 because 7 is the largest prime not larger than 9, 9 mod 7 = 2, 2 is the largest prime not greater than 2 and 2 mod 2 = 0. MATHEMATICA Abs[Table[FixedPoint[Mod[#, NextPrime[#+1, -1]]&, n], {n, 110}]] (* Harvey P. Dale, Mar 17 2023 *) PROG (PARI) a(n) = if (n==1, return (1)); na = n; while((nb = (na % precprime(na))) > 1, na = nb); return(nb); \\ Michel Marcus, Aug 22 2014 CROSSREFS Cf. A007917 and A064722 (both for the iterations). Cf. A121560, A121561, A121562, A175077, A200947. Sequence in context: A065043 A189298 A288375 * A004641 A266441 A266672 Adjacent sequences: A121556 A121557 A121558 * A121560 A121561 A121562 KEYWORD easy,nonn AUTHOR Kerry Mitchell, Aug 07 2006 EXTENSIONS New name from Michel Marcus, Aug 22 2014 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.

Last modified November 30 01:30 EST 2023. Contains 367452 sequences. (Running on oeis4.)