cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A186302 a(n) = ( A007522(n)-1 )/2.

Original entry on oeis.org

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
Offset: 1

Views

Author

Marco Matosic, Feb 17 2011

Keywords

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)

Examples

			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
		

Crossrefs

Programs

Formula

a(n) = A186303(n)-1.