Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002122
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002122 a(n) = Sum_{t=0..n} g(t)*g(n-t) where g(t) = A002121(t).
(Formerly M0273 N0096)
+0
1
1, 0, -2, 2, 3, -4, -1, 8, -1, -10, 9, 16, -18, -12, 42, 4, -58, 40, 82, -88, -54, 188, 18, -248, 151, 354, -338, -260, 760, 120, -1031, 574, 1460, -1324, -1076, 2948, 542, -3962, 2075, 5644, -4868, -4290, 11035, 2418, -14900, 7346, 21300, -17652, -16323, 40442, 9768, -54476, 25675, 78290, -62456 (list; graph; listen)
OFFSET

0,3

COMMENT

Arises in studying the Goldbach conjecture.

The last negative term appears to be a(485). - T. D. Noe, Dec 05 2006

REFERENCES

P. A. MacMahon, Properties of prime numbers deduced from the calculus of symmetric functions, Proc. London Math. Soc., 23 (1923), 290-316. [Coll. Papers, Vol. II, pp. 354-382] [The sequence G_n]

LINKS

T. D. Noe, Table of n, a(n) for n=0..1000

FORMULA

G.f.: 1/(1+Sum_{k>0} (-x)^prime(k))^2.

CROSSREFS

Cf. A002121.

Sequence in context: A087824 A008951 A119473 this_sequence A105689 A117632 A127731

Adjacent sequences: A002119 A002120 A002121 this_sequence A002123 A002124 A002125

KEYWORD

sign

AUTHOR

njas

EXTENSIONS

Edited by Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 29 2003

Entry revised by njas, Dec 04 2006

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research