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

A079385 Records in A079384.

Original entry on oeis.org

5, 53, 71, 379, 541, 1423, 2377, 3343, 9829, 13721
Offset: 1

Views

Author

N. J. A. Sloane, Feb 16 2003

Keywords

Comments

RECORDS transform of A079384.

Links

Crossrefs

Cf. A079384, A079386, A079366, A079367, A079368.

Programs

  • Mathematica
    A079384 = Cases[Import["https://oeis.org/A079384/b079384.txt", "Table"], {, }][[All, 2]];
a = {}; l = 0;
For[i = 1, i <= Length[A079384], i++,
  If[A079384[[i]] > l, l = A079384[[i]]; AppendTo[a, l]]];
a (* Robert Price, Mar 15 2020 *)

Extensions

a(4)-a(10) from Robert Price, Mar 15 2020

A079384 Costé prime expansion of 2^(1/3) - 1.

Original entry on oeis.org

5, 5, 3, 3, 3, 3, 3, 53, 13, 29, 7, 5, 11, 3, 7, 5, 11, 5, 7, 5, 71, 67, 17, 11, 5, 5, 37, 11, 2, 11, 11, 3, 11, 5, 5, 11, 7, 11, 3, 3, 3, 3, 3, 3, 11, 7, 7, 7, 5, 23, 17, 7, 17, 13, 41, 53, 23, 7, 7, 5, 5, 5, 5, 2, 7, 3, 53, 11, 3, 7, 5, 2, 7, 17, 17, 379, 107, 41, 19, 11, 5, 5, 2, 5, 5, 3, 11, 2, 29, 11, 7, 7, 13, 29, 7, 53, 53, 17, 11, 3
Offset: 0

Views

Author

N. J. A. Sloane, Feb 16 2003

Keywords

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).

Links

Crossrefs

Cf. A079385, A079386, A079366, A079367, A079368.

Programs

  • Maple
    Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y,i,t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1),p]; y := p*y-1; od; t1; end; F(2^(1/3) - 1);
  • Mathematica
    $MaxExtraPrecision = 500; P[x_]:= Module[{y}, y = Ceiling[1/x]; If[PrimeQ[y], y, NextPrime[y]]]; F[x_] := Module[{y, i, t1}, y = x; t1 = {}; For[i = 1, i <= 100, i++, AppendTo[t1, p = P[y]]; y = p*y - 1]; t1]; F[Surd[2, 3] - 1] (* G. C. Greubel, Jan 20 2019 *)

Extensions

More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003

A080348 Costé prime expansion of Catalan's constant.

Original entry on oeis.org

2, 2, 2, 5, 2, 5, 3, 7, 11, 5, 11, 7, 23, 13, 11, 3, 5, 2, 7, 5, 3, 7, 5, 13, 43, 43, 29, 17, 5, 2, 19, 11, 5, 3, 7, 5, 5, 3, 7, 7, 11, 3, 3, 7, 11, 2, 13, 7, 19, 13, 11, 11, 5, 3, 3, 3, 7, 7, 11, 3, 3, 7, 13, 37, 17, 7, 3, 7, 5, 5, 5, 2, 11, 5, 5, 5, 5, 2, 5, 5, 37, 7, 157, 53, 1361, 131, 107
Offset: 0

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003

Keywords

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).

Links

Crossrefs

Cf. A079385, A079386, A079366, A079367, A079368.

Programs

  • Maple
    Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y,i,t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1),p]; y := p*y-1; od; t1; end; F(Catalan);

A080349 Costé prime expansion of Pi-e.

Original entry on oeis.org

3, 5, 3, 23, 11, 3, 7, 5, 3, 37, 13, 11, 2, 17, 11, 3, 17, 11, 2, 29, 5, 29, 11, 3, 3, 5, 5, 479, 89, 23, 17, 11, 3, 5, 3, 7, 5, 5, 7, 5, 2, 11, 5, 3, 7, 5, 2, 5, 5, 29, 5, 5, 7, 11, 5, 7, 7, 7, 17, 5, 7, 5, 13, 23, 11, 3, 29, 23, 7, 3, 11, 3, 5, 19, 53, 19, 23, 29, 67, 1409, 347, 37, 13, 13
Offset: 0

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003

Keywords

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).

Links

Crossrefs

Cf. A079385, A079386, A079366, A079367, A079368, A080348.

Programs

  • Maple
    Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y,i,t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1),p]; y := p*y-1; od; t1; end; F(Pi-exp(1));

A080350 Costé prime expansion of 1/Pi.

Original entry on oeis.org

5, 2, 7, 5, 3, 5, 11, 3, 7, 5, 2, 7, 79, 67, 19, 29, 59, 11, 5, 11, 3, 47, 31, 607, 419, 47, 19, 43, 37, 7, 3, 29, 7, 7, 5, 5, 157, 53, 89, 17, 5, 37, 7, 11, 3, 17, 5, 3, 3, 29, 127, 19, 11, 11, 5, 3, 13, 41, 13, 11, 3, 11, 11, 5, 11, 3, 3, 5, 2, 5, 2, 5, 3, 7, 3, 17, 5, 11, 3, 11, 17, 5, 3, 5
Offset: 0

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003

Keywords

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).

Links

Crossrefs

Cf. A079385, A079386, A079366, A079367, A079368, A080348, A080349.

Programs

  • Maple
    Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y,i,t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1),p]; y := p*y-1; od; t1; end; F(1/Pi);

A080351 Costé prime expansion of 1/exp(1).

Original entry on oeis.org

3, 11, 11, 2, 13, 23, 17, 23, 7, 7, 5, 3, 13, 11, 5, 3, 23, 17, 7, 5, 5, 3, 5, 3, 5, 5, 3, 5, 2, 149, 19, 103, 577, 389, 1039, 223, 29, 11, 3, 3, 7, 5, 2, 7, 3, 191, 47, 13, 11, 7, 5, 3, 7, 3, 7, 13, 29, 11, 3, 3, 3, 3, 5, 5, 2, 5, 2, 5, 3, 79, 137, 173, 59, 157, 29, 17, 7, 13, 79, 281
Offset: 0

Views

Author

Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 17 2003

Keywords

Comments

For x in (0,1], define P(x) = min{p: p prime, 1/x < p}, Phi(x) = P(x)x - 1. Costé prime expansion of x(0) is sequence a(0), a(1), ... given by x(n) = Phi(x(n-1)) (n>0), a(n) = P(x(n)) (n >= 0).

Links

Crossrefs

Cf. A001113, A079385, A079386, A079366, A079367, A079368, A080348, A080349, A080350.

Programs

  • Maple
    Digits := 500: P := proc(x) local y; y := ceil(evalf(1/x)); if isprime(y) then y else nextprime(y); fi; end; F := proc(x) local y,i,t1; y := x; t1 := []; for i from 1 to 100 do p := P(y); t1 := [op(t1),p]; y := p*y-1; od; t1; end; F(1/exp(1));
Showing 1-6 of 6 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.