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.

A135145 Values of m where A020482(m) != A060308(m-1).

Original entry on oeis.org

49, 61, 64, 74, 95, 104, 110, 125, 146, 151, 154, 163, 166, 173, 184, 199, 205, 209, 215, 229, 238, 244, 250, 259, 266, 269, 278, 293, 314, 320, 335, 346, 350, 355, 359, 364, 376, 385, 391, 394, 398, 403, 410, 419, 424, 427, 436, 439, 448, 451, 454, 460
Offset: 1

Views

Author

Harry J. Smith, Nov 20 2007

Keywords

Comments

Usually the greatest p with p,q both prime, p+q = 2m, is equal to the largest prime <= 2m-2, but not always. These are the exceptions.
Almost all natural numbers are in the sequence so the above comment is misleading in general, and only fitting for small numbers. - Jens Kruse Andersen, Jul 13 2014

Crossrefs

Programs

  • Mathematica
    a2[n_] := {p, q} /. {ToRules @ Reduce[p+q == 2*n, {p, q}, Primes]} // Max; a8[n_] := Max[FactorInteger[(2*n)!/n!^2]]; Select[Range[500], a2[#] != a8[#-1]&] (* Jean-François Alcover, Dec 19 2013 *)
  • PARI
    for(m=2, 1000, p=precprime(2*m-2); if(!isprime(2*m-p), print1(m", "))) \\ Jens Kruse Andersen, Jul 12 2014