Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140668 a(n) = n + A140664(n). +0
1
2, 0, 0, 4, 0, 7, 0, 8, 9, 11, 0, 12, 0, 15 (list; graph; listen)
OFFSET

1,1

COMMENT

For n>1, a(n) = n iff mu(n) = 0; 0 if n is prime; and (n+1) iff mu(n) = 1.

FORMULA

a(n) = n + A140664(n), where A140664 = (1, -2, -3, 0, -5, 1, -7, 0, 0, 1,...)

EXAMPLE

a(4) = 4 = 4 + A140664(4) = 4 + 0.

CROSSREFS

Cf. A140664, A008683.

Sequence in context: A022002 A084658 A137513 this_sequence A071390 A061669 A136334

Adjacent sequences: A140665 A140666 A140667 this_sequence A140669 A140670 A140671

KEYWORD

nonn

AUTHOR

Gary W. Adamson and Mats Granvik (qntmpkt(AT)yahoo.com), May 20 2008

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research