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.

A242037 a(n) is the smallest k such that in the interval [1,k] of sequence A242034 all odd primes <= prime(n) are present.

Original entry on oeis.org

1, 2, 23, 23, 63, 63, 120, 228, 228, 386, 460, 460, 602, 896, 1096, 1096, 1416, 1416, 1416, 3158, 3158, 3158, 3204, 3438, 3438, 3966, 3966, 3966, 8229, 8229, 8229, 8229, 8229, 8229, 8229, 8229, 8229, 8294, 8593, 8593, 11125, 11125, 11559, 11559, 12216, 13594
Offset: 2

Views

Author

Vladimir Shevelev, Aug 12 2014

Keywords

Crossrefs

Programs

  • Mathematica
    lpf[n_]:=lpf[n]=First[First[FactorInteger[n]]]; (* least prime factor *)
    A242034=Map[lpf[#-3]&,Select[Range[6,100000,2],lpf[#-1]>lpf[#-3]&](*A243937*)];
    pos={};NestWhile[#+1&,2,(AppendTo[pos,Position[A242034,Prime[#],1,1]];!Last[pos]=={})&];
    A242037=Rest[FoldList[Max,-Infinity,Flatten[pos]]] (* Peter J. C. Moses, Aug 14 2014 *)

Extensions

More terms from Peter J. C. Moses, Aug 12 2014