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.

A210701 The location of records in A210700.

Original entry on oeis.org

1, 2, 3, 8, 17, 29, 69, 72, 86, 97, 102, 106, 187, 192, 307, 388, 840, 973, 1016, 1019, 2823, 3699, 6236, 6317, 10592, 13428, 15609, 16572, 21097, 22686, 29476, 42612, 53024, 68452, 178429, 239408, 424891, 546353, 1168824, 1378089, 1469687, 1880521, 1880689
Offset: 1

Views

Author

Jason Kimberley, Oct 15 2012

Keywords

Comments

In other words, m < a(n) implies A210700(m) < A210700(a(n)).

Links

A210702 Records in A210700.

Original entry on oeis.org

0, 1, 2, 5, 8, 14, 16, 17, 19, 20, 25, 35, 38, 55, 62, 67, 73, 82, 121, 130, 140, 160, 191, 232, 233, 245, 260, 283, 308, 379, 391, 437, 481, 607, 650, 673, 784, 790, 841, 856, 920, 1036, 1114, 1234, 1241, 1316, 1402, 1504, 1540, 1610, 1684, 1774, 1811
Offset: 1

Views

Author

Jason Kimberley, Oct 15 2012

Keywords

Crossrefs

Cf. A210701 (location of records).

Programs

  • Mathematica
    sml[n_]:=Module[{m=0},While[!PrimeQ[3n-m]||!PrimeQ[3n+m],m++];m]; DeleteDuplicates[ Array[sml,3000000],GreaterEqual] (* The program generates the first 43 terms of the sequence. *) (* Harvey P. Dale, Sep 23 2022 *)

Formula

a(n) = A210700(A210701(n)).
Showing 1-2 of 2 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.