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!)
A073438 Remainder of division G[n]/Pi[n], where G[n] is the number of composites not exceeding n. 0
0, 0, 1, 1, 2, 2, 3, 0, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 8, 0, 8, 9, 8, 9, 10, 0, 1, 2, 0, 1, 2, 3, 1, 2, 0, 1, 2, 3, 1, 2, 3, 4, 5, 6, 4, 5, 6, 7, 8, 9, 7, 8, 6, 7, 8, 9, 10, 11, 9, 10, 11, 12, 10, 11, 9, 10, 11, 12, 13, 14, 12, 13, 14, 15, 13, 14, 15, 16, 17, 18, 16, 17, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,5
LINKS
FORMULA
a(n)=Mod[A065855(n), A000720(n)]=Mod[n-Pi[n]-1, Pi[n]] for n>1.
EXAMPLE
n=100: G[100]=100-Pi[100]-1=100-25-1=74, Pi[100]=25, remainder=a(100)=Mod[74,25]=24.
MATHEMATICA
Table[Mod[w-PrimePi[w]-1, PrimePi[w]], {w, 1, 128}]
CROSSREFS
Sequence in context: A330629 A304760 A304759 * A187096 A340146 A340143
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 31 2002
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 July 14 10:28 EDT 2024. Contains 374318 sequences. (Running on oeis4.)