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.

Showing 1-2 of 2 results.

A208292 Primes of the form (n^2+1)/26.

Original entry on oeis.org

17, 37, 457, 601, 701, 877, 997, 2017, 3037, 3257, 4957, 5237, 5701, 10601, 11257, 11677, 14737, 15217, 16001, 17317, 17837, 21577, 22157, 24677, 29717, 34057, 39157, 39937, 41201, 50777, 52201, 53101, 75277, 78101, 79201, 89917, 91097, 93001, 94201, 96137
Offset: 1

Views

Author

Wolfdieter Lang, Feb 27 2012

Keywords

Comments

Equivalently, primes of the form (K^2 + (K+1)^2)/13. The
connection to the primes of the form (m^2+1)/26 is given by m=2*K+1 (m is necessarily odd).
The corresponding m=m(n) values are given in A208293(n).
Equivalently, primes of the form (4*T(K)+1)/13, with the
corresponding triangular numbers T(K):=A000217(K), for
K=K(n)=(m(n)-1)/2, given in A208294(n).
For n>=2 the smallest positive representative of the class of
nontrivial solutions of the congruence x^2==1 (Modd a(n)) is
x=m(n). The trivial solution is the class with representative x=1, which also includes -1. For the prime
a(1)=17 the nontrivial solution is 13 (see A002733(2)). Unique nontrivial smallest positive representatives exist for the solutions for any prime of the form 4*k+1, given in A002144. Here the subset with k=k(n)=(a(n)-1)/4 appears, namely 4,9,114,150,175,219,.... For Modd n see a comment on A203571.
These primes with corresponding m values are such that floor(m(n)^2/p(n)) = 5^2, n>=1.

Examples

			a(3)=457, m(3)=A208293(3)=109. T(K(3))=A000217((109-1)/2)=
  A000217(54)=A208294(3)=1485.
		

Crossrefs

Cf. A207337, A207339 (case floor(m^2/p)=3^2); A129307, A027862, A002731 (case floor(m^2/p)=1^2).

Programs

  • Mathematica
    Select[(Range[2000]^2 + 1)/26, PrimeQ] (* T. D. Noe, Feb 28 2012 *)

Formula

a(n) is the n-th member of the increasingly ordered list of primes of the form (m^2+1)/10, where m=m(n) is necessarily an odd integer, the positive one is A208293(n).

A208293 Numbers n such that (n^2+1)/26 is prime.

Original entry on oeis.org

21, 31, 109, 125, 135, 151, 161, 229, 281, 291, 359, 369, 385, 525, 541, 551, 619, 629, 645, 671, 681, 749, 759, 801, 879, 941, 1009, 1019, 1035, 1149, 1165, 1175, 1399, 1425, 1435, 1529, 1539, 1555, 1565, 1581, 1669, 1685, 1695, 1799, 1851, 1919, 1945, 1971
Offset: 1

Views

Author

Wolfdieter Lang, Feb 27 2012

Keywords

Comments

The corresponding primes (n^2+1)/26 are given in A208292(n).
a(n) is the smallest positive representative of the class of
nontrivial solutions of the congruence x^2==1 (Modd A208292(n)), if n>=2. The trivial solution is the class with representative x=1, which also includes -1. For Modd n see a comment on A203571. For n=1: a(1) = 21 == 13 (Modd 17), and 13 is the smallest positive solution >1.
The unique class of nontrivial solutions of the congruence x^2==1 (Modd p), with p an odd prime, exists for any p of the form 4*k+1, given in A002144. Here a subset of these primes is covered, the ones for k=k(n)=(a(n)^2-25)/(4*26). These values are 4, 9, 114, 150, 175, 219, ...

Examples

			a(3)=109 because (109^2+1)/26 = 457 is prime.
  109 = sqrt(26*457-1) = sqrt(8*1485+1).
		

Crossrefs

Programs

Formula

a(n) = sqrt(26*A208292(n)-1) = sqrt(8*A208294(n)+1), n>=1.
Showing 1-2 of 2 results.