login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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
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, 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, 14, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 19, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,11

COMMENTS

A Moebius quintuple count.

Numbers appear in quintuples or multiples of quintuples.

LINKS

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

CROSSREFS

Sequence in context: A213809 A204854 A113215 * A130497 A178154 A270774

Adjacent sequences: A105588 A105589 A105590 * A105592 A105593 A105594

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 02:51 EST 2022. Contains 358406 sequences. (Running on oeis4.)