|
| |
|
|
A127308
|
|
Number of ways of writing the n-th prime p(n) as a sum of 24 squares.
|
|
1
| |
|
|
1104, 16192, 1362336, 44981376, 6631997376, 41469483552, 793229226336, 2697825744960, 22063059606912, 282507110257440, 588326886375936, 4119646755044256, 12742799887509216, 21517654506205632, 57242599902057216
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Deligne proved that |a(n) - (16/691)*(p(n)^11 + 1)| <= (66304/691)*sqrt(p(n)^11).
|
|
|
REFERENCES
| E. Grosswald, Representations of Integers as Sums of Squares, Springer-Verlag, NY, 1985, p. 107.
Barry Mazur, The Structure of Error Terms in Number Theory and an Introduction to the Sato-Tate Conjecture, Current Events Bulletin, Amer. Math. Soc., 2007.
Barry Mazur, Controlling our errors, Nature 443, 7 (2006) 38-40.
Barry Mazur, Finding meaning in error terms, Bull. Amer. Math. Soc., 45 (No. 2, 2008), 185-228.
|
|
|
LINKS
| N. J. A. Sloane, Table of n, a(n) for n = 1..70
Barry Mazur, The Structure of Error Terms in Number Theory and an Introduction to the Sato-Tate Conjecture
Barry Mazur, Controlling our errors
Tony Phillips, Math in the Media
|
|
|
FORMULA
| a(n) ~ (16/691)*(p(n)^11 + 1) as n -> oo.
|
|
|
EXAMPLE
| For p(1) = 2, two of the 24 squares are (+-1)^2 and the other 22 are 0^2, so a(1) = 2*2*binomial(24,2) = 4*276 = 1104.
|
|
|
MATHEMATICA
| Table[SquaresR[24, Prime[n]], {n, 1, 70}]
|
|
|
CROSSREFS
| a(n) = A000156(p(n)).
Cf. A000594.
Sequence in context: A178348 A060519 A197422 * A022055 A008688 A107519
Adjacent sequences: A127305 A127306 A127307 * A127309 A127310 A127311
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jonathan Sondow (jsondow(AT)alumni.princeton.edu), Jan 10 2007
|
| |
|
|
