login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006308 Coefficients of period polynomials.
(Formerly M2834)
4
3, 10, 21, 55, 78, 136, 171, 253, 406, 465, 666, 820, 903, 1081, 1378, 1711, 1830, 2211, 2485, 2628, 3081, 3403, 3916, 4656, 5050 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
Conjecture: a(n) = A008837(n) = p*(p-1)/2 = Sum_{k=0..p-1} mod(k^3, p) where p = prime(n). - Michael Somos, Feb 17 2020
REFERENCES
D. H. and Emma Lehmer, Cyclotomy for nonsquarefree moduli, pp. 276-300 of Analytic Number Theory (Philadelphia 1980), Lect. Notes Math. 899 (1981).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939, p. 243.
LINKS
FORMULA
For an odd prime p, let g be a primitive root of p^2, q=g^p, and zeta=exp(2*pi*i/p^2). Define h(p,k) = Sum_{j=0..p-2} zeta^((q+k*p)*q^j) and a polynomial f(p,x) = Product_{k=0..p-1} (x-h(p,k)). Finally, a(n) = -[x^(p-2)] f(p,x) where p = A000040(n) is the n-th prime. - Sean A. Irvine, Mar 07 2017
CROSSREFS
Cf. A008837. [From R. J. Mathar, Oct 28 2008]
Sequence in context: A192033 A295063 A298856 * A008837 A176098 A355389
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms and offset corrected by Sean A. Irvine, Mar 07 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 09:48 EDT 2024. Contains 371905 sequences. (Running on oeis4.)