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!)
A105590 a(n)=n+2-sum{k=0..n, -mu(k-mod(k^3,3k))} 0
1, 1, 1, 1, 1, 1, 3, 3, 3, 4, 4, 4, 5, 5, 5, 7, 7, 7, 8, 8, 8, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 14, 14, 14, 15, 15, 15, 17, 17, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 21, 21, 21, 22, 22, 22, 24, 24, 24, 25, 25, 25, 26, 26, 26, 26, 26, 26, 28, 28, 28, 29, 29, 29, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

COMMENTS

A Moebius triple count.

Numbers appear in triples or multiples of triples.

LINKS

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

CROSSREFS

Sequence in context: A096056 A050501 A327469 * A220845 A073750 A270059

Adjacent sequences: A105587 A105588 A105589 * A105591 A105592 A105593

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 February 3 13:54 EST 2023. Contains 360035 sequences. (Running on oeis4.)