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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A186302 a(n) = ( A007522(n)-1 )/2. 4
 3, 11, 15, 23, 35, 39, 51, 63, 75, 83, 95, 99, 111, 119, 131, 135, 155, 179, 183, 191, 215, 219, 231, 239, 243, 251, 299, 303, 315, 323, 359, 363, 371, 375, 411, 419, 431, 443, 455, 459, 483, 491, 495, 515, 519, 531, 543, 551 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS From Wolfdieter Lang, Oct 24 2013: (Start) Each a(n) is of course congruent 3 (mod 4). a(n) = A055034(p7m8(n)), with p7m8(n) := A007522(n). This is the degree of the minimal polynomial of rho(p7m8(n)):= 2*cos(Pi/p7m8(n)), called C(p7m8(n), x) in A187360. (End) LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A186303(n)-1. EXAMPLE Degree of minimal polynomial C(prime 7 (mod 8), x): n = 2, p7m8(2) = A007522(2) = 23, delta(23) = 11. - Wolfdieter Lang, Oct 24 2013 MATHEMATICA (Select[8*Range[200] - 1, PrimeQ] - 1)/2 (* Amiram Eldar, Jun 08 2022 *) PROG (PARI) is(n)=n%4==3&&isprime(2*n+1) \\ Charles R Greathouse IV, Jan 22 2013 CROSSREFS Cf. A007522, A055034, A186303, A187360. Sequence in context: A294690 A331831 A357440 * A323103 A046159 A022410 Adjacent sequences: A186299 A186300 A186301 * A186303 A186304 A186305 KEYWORD nonn,easy AUTHOR Marco Matosic, Feb 17 2011 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.

Last modified May 27 19:17 EDT 2023. Contains 362985 sequences. (Running on oeis4.)