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

%I #2 Mar 30 2012 18:59:06

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

%T 6,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,10,10,10,10,10,10,10,11,

%U 11,11,11,11,11,11,11,11,11,11,11,11,11,13,13,13,13,13,13,13,14,14,14,14

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

%C A Moebius septuple count.

%C Numbers appear in septuples or multiples of septuples.

%K easy,nonn

%O 0,15

%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 April 25 09:49 EDT 2024. Contains 371967 sequences. (Running on oeis4.)