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.

A259712 Least positive integer k such that prime(k) + prime(k*n) is a square.

Original entry on oeis.org

1, 10, 2, 1, 1126, 60, 55, 691, 1, 24, 15, 640, 5, 41, 1, 671, 261, 3, 8, 219, 103, 1, 1843, 128, 2240, 4, 664, 12, 111, 275, 19, 576, 166, 5, 3, 13, 7462, 243, 1, 1599, 228, 6297, 128, 853, 995, 49, 164, 1, 116, 10, 40, 3971, 1741, 32, 338, 11992, 3, 39, 20, 24, 2, 465, 352, 24, 138, 241, 343, 177, 32, 3
Offset: 1

Views

Author

Zhi-Wei Sun, Jul 03 2015

Keywords

Comments

Conjecture: a(n) exists for any n > 0. In general, every positive rational number r can be written as m/n, where m and n are positive integers with prime(m) + prime(n) a square.
I have verified this conjecture for all those r = a/b with a,b = 1,...,700.

Examples

			a(2) = 10 since prime(10) + prime(10*2) = 29 + 71 = 10^2.
a(5) = 1126 since prime(1126) + prime(1126*5) = 9059 + 55457 = = 64516 = 254^2.
		

References

  • Zhi-Wei Sun, Problems on combinatorial properties of primes, in: M. Kaneko, S. Kanemitsu and J. Liu (eds.), Number Theory: Plowing and Starring through High Wave Forms, Proc. 7th China-Japan Seminar (Fukuoka, Oct. 28 - Nov. 1, 2013), Ser. Number Theory Appl., Vol. 11, World Sci., Singapore, 2015, pp. 169-187.

Crossrefs

Programs

  • Mathematica
    SQ[n_]:=IntegerQ[Sqrt[n]]
    Do[k=0;Label[bb];k=k+1;If[SQ[Prime[k]+Prime[k*n]],Goto[aa],Goto[bb]];Label[aa];Print[n," ",k];Continue,{n,1,70}]
    lpi[n_]:=Module[{k=1},While[!IntegerQ[Sqrt[Prime[k]+Prime[k*n]]],k++];k]; Array[ lpi,70] (* Harvey P. Dale, Sep 07 2022 *)