Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076369
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076369 n + mu(n), where mu is the Moebius-function (A008683). +0
1
2, 1, 2, 4, 4, 7, 6, 8, 9, 11, 10, 12, 12, 15, 16, 16, 16, 18, 18, 20, 22, 23, 22, 24, 25, 27, 27, 28, 28, 29, 30, 32, 34, 35, 36, 36, 36, 39, 40, 40, 40, 41, 42, 44, 45, 47, 46, 48, 49, 50, 52, 52, 52, 54, 56, 56, 58, 59, 58, 60, 60, 63, 63, 64, 66, 65, 66, 68, 70, 69, 70, 72 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) = n iff n is not square-free:

a(A013929(k))=A013929(k) and a(A005117(k))<>A005117(k).

FORMULA

a(n)=n+MoebiusMu[n]=A000027[n]+A008683[n].

CROSSREFS

Cf. A000027, A008683, A063015, A076840.

Sequence in context: A073252 A134005 A132320 this_sequence A072727 A057061 A034804

Adjacent sequences: A076366 A076367 A076368 this_sequence A076370 A076371 A076372

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com) and Labos E. (labos(AT)ana.sote.hu), Oct 14 2002

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research