login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
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, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,15

COMMENTS

A Moebius septuple count.

Numbers appear in septuples or multiples of septuples.

LINKS

Table of n, a(n) for n=0..87.

CROSSREFS

Sequence in context: A115787 A300959 A259581 * A210745 A187471 A083565

Adjacent sequences:  A105589 A105590 A105591 * A105593 A105594 A105595

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Apr 14 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 23:09 EST 2021. Contains 340383 sequences. (Running on oeis4.)