Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089451
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089451 mu(prime(n)-1), where mu is the Moebius function. +0
7
1, -1, 0, 1, 1, 0, 0, 0, 1, 0, -1, 0, 0, -1, 1, 0, 1, 0, -1, -1, 0, -1, 1, 0, 0, 0, -1, 1, 0, 0, 0, -1, 0, -1, 0, 0, 0, 0, 1, 0, 1, 0, -1, 0, 0, 0, 1, -1, 1, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 1, 0, 1, 0, 0, 1, -1, 0, 0, 1, 0, 0, 0, 0, -1, 0, -1, 0, -1, -1, 0, 0, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 0, -1, 0, 0 (list; graph; listen)
OFFSET

1,1

COMMENT

Note that A049092 lists prime(n) such that a(n) = 0. Similarly, A078330 lists prime(n) such that a(n) = -1. See A088179 for prime(n) such that a(n) = 1. Also note that a(n) = A088144(n) mod prime(n).

LINKS

Ed Pegg, Jr., Moebius Function (and squarefree numbers)

Eric Weisstein's World of Mathematics, Moebius Function

FORMULA

a(n)=A067460(n)-1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 04 2003

MATHEMATICA

Table[MoebiusMu[Prime[n]-1], {n, 150}]

PROGRAM

(PARI) a(n)=moebius(prime(n)-1)

CROSSREFS

Cf. A089495 (mu(p+1) for prime p), A089496 (mu(p+1)+mu(p-1) for prime p), A089497 (mu(p+1)-mu(p-1) for prime p).

Adjacent sequences: A089448 A089449 A089450 this_sequence A089452 A089453 A089454

Sequence in context: A077050 A128432 A039966 this_sequence A070886 A041004 A141736

KEYWORD

sign

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Nov 03 2003

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 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research