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!)
A073366 Remainder when n-th prime is divided by number of composites not exceeding n. 2
0, 0, 1, 1, 1, 3, 4, 1, 1, 5, 1, 7, 8, 5, 1, 7, 5, 1, 1, 5, 5, 7, 5, 1, 17, 1, 18, 13, 11, 11, 7, 11, 7, 13, 13, 11, 11, 17, 13, 23, 19, 17, 13, 25, 31, 29, 25, 23, 23, 25, 29, 29, 29, 29, 25, 31, 29, 31, 35, 43, 41, 37, 35, 2, 1, 4, 49, 3, 2, 10, 9, 8, 5, 4, 5, 9, 10, 13, 8, 18, 13, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
4,6
LINKS
FORMULA
a(n) = A000040(n) mod A065855(n).
EXAMPLE
For n=4, p(4) mod 4-Pi(4)-1 = 7 mod 1 = 0 = a(4).
MATHEMATICA
Table[Mod[Prime[w], w-PrimePi[w]-1], {w, 1, 128}]
CROSSREFS
Sequence in context: A275886 A158572 A083532 * A001086 A105283 A347178
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 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)