Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

2,1

COMMENT

This sum is always -1, 0 or 1 because for odd prime p, both p-1 and p+1 cannot be square-free; one of them will be divisible by 4. This also implies that terms in this sequence are zero only for primes p such that mu(p-1) = mu(p+1) = 0, which is A075432.

LINKS

Eric Weisstein's World of Mathematics, Moebius Function

Eric Weisstein's World of Mathematics, Legendre Symbol

FORMULA

Let p = prime(n), then a(n) = mu(p+(-1/p)), where (-1/p) is the Legendre symbol, A070750. (Pieter Moree)

MATHEMATICA

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

CROSSREFS

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

Sequence in context: A014044 A014079 A089497 this_sequence A114592 A118110 A131522

Adjacent sequences: A089493 A089494 A089495 this_sequence A089497 A089498 A089499

KEYWORD

sign

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Nov 04 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research