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!)
A073367 Remainder when n-th composite is divided by number of composites not exceeding n. 2
0, 0, 0, 0, 0, 0, 3, 0, 3, 4, 3, 1, 8, 0, 8, 0, 10, 9, 8, 9, 8, 8, 7, 6, 6, 8, 7, 8, 8, 7, 6, 5, 4, 6, 5, 4, 3, 4, 4, 6, 5, 4, 3, 4, 4, 3, 2, 2, 2, 3, 2, 1, 0, 0, 40, 0, 0, 1, 0, 43, 43, 44, 44, 45, 45, 45, 45, 46, 47, 48, 48, 49, 50, 50, 50, 52, 53, 53, 53, 55, 55, 55, 55, 55, 55, 56, 56, 56 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,7
LINKS
FORMULA
a(n) = A002808(n) mod A065855(n).
EXAMPLE
For n=4: a(4) = composite(4) mod (4-Pi(4)-1) = 9 mod 1 = 0; n=19:
a(19) = composite(19) mod (19-Pi(19)-1) = 30 mod 10 = 0.
MATHEMATICA
f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] Table[Mod[f[w], w-PrimePi[w]-1], {w, 1, 128}]
CROSSREFS
Sequence in context: A210877 A127753 A197736 * A222769 A111862 A277092
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 30 2002
EXTENSIONS
Edited by Michael De Vlieger, Nov 05 2020
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 April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)