|
| |
|
|
A151763
|
|
If n is a prime == 1 mod 4 then a(n) = 1, if n is a prime == 3 mod 4 then a(n) = -1, otherwise a(n) = 0.
|
|
8
| |
|
|
0, 0, -1, 0, 1, 0, -1, 0, 0, 0, -1, 0, 1, 0, 0, 0, 1, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, -1, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(A002145(n)) = -1; a(A065090(n)) = 0; a(A002144(n)) = 1. [Reinhard Zumkeller, Oct 06 2011]
|
|
|
REFERENCES
| N. Katz, Lang-Trotter revisited, Bull. Amer. Math. Soc., 46 (2009), 413-457.
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| a(n) = (2 - n mod 4) * A010051(n).
|
|
|
PROG
| (Haskell)
a151763 n | even n = 0
| a010051 n == 1 = 2 - n `mod` 4
| otherwise = 0
-- Reinhard Zumkeller, Oct 06 2011
|
|
|
CROSSREFS
| Cf. A0792600, A0792601.
Sequence in context: A060510 A072629 A164292 * A022925 A144607 A051840
Adjacent sequences: A151760 A151761 A151762 * A151764 A151765 A151766
|
|
|
KEYWORD
| sign
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jun 22 2009
|
| |
|
|
