Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105590
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105590 a(n)=n+2-sum{k=0..n, -mu(k-mod(k^3,3k))} +0
1
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; listen)
OFFSET

0,7

COMMENT

A Moebius triple count.

Numbers appear in triples or multiples of triples.

CROSSREFS

Adjacent sequences: A105587 A105588 A105589 this_sequence A105591 A105592 A105593

Sequence in context: A134849 A050501 A096056 this_sequence A073750 A120204 A069941

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 14 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research