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-4 of 4 results.

A060392 Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.

Original entry on oeis.org

0, 1, 5, 47, 11, 221, 17, 1217, 941, 2747, 8081, 9281, 41, 55661, 19421, 333491, 1262201, 601037, 5237651, 9063641, 12899891, 26149427, 24073871, 28537121, 352031501, 398878547, 160834691, 67374467, 146452961, 24169417397
Offset: 1

Views

Author

Luis Rodriguez-Torres (ludovicusmagister(AT)yahoo.com), Apr 03 2001

Keywords

Comments

Chris Nash (see the Prime Puzzles link) has shown that such an m always exists.
For n>1, least odd number d such that the Legendre symbol (1-4d/prime(k)) = -1 for k = 2,...,n, but not for n+1. - T. D. Noe, Apr 19 2004

Examples

			k^2 + k takes the values 0, 2, 6, 12, ... for k = 0,1,2,...; the smallest prime divisor of these numbers is 2, so f(0) = 2.

References

  • R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: their history and some applications. Nieuw Arch. Wisk. (4) 13 (1995), no. 1, 113-139. Math. Rev. 96m:11082

Links

Crossrefs

Cf. A060380, A060393-A060398. A060394 gives associated values of k.

Programs

  • Mathematica
    nn=20; a=Table[0, {nn}]; d=-1; While[Length[Select[a, # == 0&]] != 1, d=d+2; i=2; While[JacobiSymbol[1-4d, Prime[i]]==-1, i++ ]; If[i<=nn && a[[i]]==0, a[[i]]=d]]; a (* corrected by Jean-François Alcover, Feb 06 2019 *)
  • PARI
    lista(nn) = {va = vector(nn); d = -1; while (#select(x->(x==0), va) != 1, d += 2; i = 2; while(kronecker(1-4*d, prime(i)) == -1, i++); if ((i <= nn) && (va[i] == 0), va[i] = d);); va;} \\ Michel Marcus, Feb 05 2019

Extensions

Corrected by T. D. Noe, Apr 19 2004

A060380 Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.

Original entry on oeis.org

2, 3, 5, 47, 11, 221, 17, 1217, 941, 2747, 8081, 9281, 41, 55661, 19421, 333491, 1262201, 601037, 5237651, 9063641, 12899891, 26149427, 24073871, 28537121, 352031501, 398878547, 160834691, 67374467, 146452961, 24169417397
Offset: 1

Views

Author

Luis Rodriguez-Torres (ludovicusmagister(AT)yahoo.com), Apr 03 2001

Keywords

Comments

Chris Nash (see the Prime Puzzles link) has shown that such an m always exists.
For n>2, least odd number d such that the Legendre symbol (1-4d/prime(k)) = -1 for k = 2,...,n, but not for n+1. See A060392. - T. D. Noe, Apr 19 2004

Examples

			k^2 + k + 2 takes the values 2, 4, 8, 14, ... for k = 0,1,2,...; the smallest prime divisor of these numbers is 2, so f(2) = 2.

References

  • R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: their history and some applications. Nieuw Arch. Wisk. (4) 13 (1995), no. 1, 113-139. Math. Rev. 96m:11082

Links

Crossrefs

Cf. A060392-A060398. A060393 gives associated values of k.

Programs

  • Mathematica
    (* This program is not convenient beyond a(24) *) a[1] = 2; a[2] = 3; a[n_] := For[d = 1, True, d = d+2, If[And @@ (# == -1 & /@ Table[JacobiSymbol[1 - 4d, Prime[k]], {k, 2, n}]) && JacobiSymbol[1 - 4d, Prime[n+1]] != -1, Return[d]]]; Table[Print[an = a[n]]; an, {n, 1, 24}] (* Jean-François Alcover, Oct 14 2013, after T. D. Noe *)

Extensions

Corrected by T. D. Noe, Apr 19 2004

A060395 Smallest prime that divides k^2 + k + n for k = 0, 1, 2, ....

Original entry on oeis.org

2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 11, 2, 3, 2, 3, 2, 17, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 41, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 11
Offset: 0

Views

Author

N. J. A. Sloane, Apr 04 2001

Keywords

Examples

			To obtain a(7), note that x^2+x+7 takes the values 7,9,13,19,... for k=0,1,2,... and the smallest prime dividing these numbers is 3.

Links

Crossrefs

Cf. A060380, A060392-A060398. A060396 gives values of k.

Programs

  • Mathematica
    a[n_] := Switch[n, 0, 2, 1, 3, , Module[{f, kmax0 = 2}, f[kmax] := f[kmax] = MinimalBy[Table[{k, FactorInteger[k^2 + k + n][[1, 1]]}, {k, 0, kmax}], Last, 1]; f[kmax = kmax0]; f[kmax = 2 kmax]; While[f[kmax] != f[kmax/2], kmax = 2 kmax]; f[kmax][[1, 2]]]];
Table[a[n], {n, 0, 101}] (* Jean-François Alcover, Aug 15 2022 *)

Formula

a(n)=2 if n is equal to 0, 2 or 4 modulo 6; a(n)=3 if n is equal to 1 or 3 modulo 6.

Extensions

More terms from Matthew Conroy, Apr 18 2001

A060397 Smallest prime that divides k^2 + k + 2n + 1 for k = 0,1,2,....

Original entry on oeis.org

3, 3, 5, 3, 3, 11, 3, 3, 17, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 41, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 11, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3
Offset: 0

Views

Author

N. J. A. Sloane, Apr 04 2001

Keywords

Comments

Bisection of A060395.

Examples

			To obtain a(3), note that x^2+x+7 takes the values 7,9,13,19,... for k=0,1,2,... and the smallest prime dividing these numbers is 3.

Links

Crossrefs

Cf. A060380, A060392-A060398. A060398 gives values of k.

Programs

  • Mathematica
    a[n_] := Switch[n, 0, 3, , Module[{f, kmax0 = 2}, f[kmax] := f[kmax] = MinimalBy[Table[{k, FactorInteger[k^2 + k + 2 n + 1][[1, 1]]}, {k, 0, kmax}], Last, 1]; f[kmax = kmax0]; f[kmax = 2 kmax]; While[f[kmax] != f[kmax/2], kmax = 2 kmax]; f[kmax][[1, 2]]]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Aug 15 2022 *)

Formula

a(n)=3 if n is equal to 0 or 1 mod 3.

Extensions

More terms from Matthew Conroy, Apr 18 2001
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.