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!)
A105591 a(n)=n+2-sum{k=0..n, -mu(k-mod(k^5,5k))} 0

%I

%S 1,1,1,1,1,1,1,1,1,1,3,3,3,3,3,5,5,5,5,5,6,6,6,6,6,7,7,7,7,7,7,7,7,7,

%T 7,9,9,9,9,9,10,10,10,10,10,11,11,11,11,11,12,12,12,12,12,14,14,14,14,

%U 14,15,15,15,15,15,17,17,17,17,17,17,17,17,17,17,18,18,18,18,18,19,19,19

%N a(n)=n+2-sum{k=0..n, -mu(k-mod(k^5,5k))}

%C A Moebius quintuple count.

%C Numbers appear in quintuples or multiples of quintuples.

%K easy,nonn

%O 0,11

%A _Paul Barry_, Apr 14 2005

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 February 3 07:57 EST 2023. Contains 360024 sequences. (Running on oeis4.)