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.

A231988 Primes of the form triangular(p) + 1, where p is a prime.

Original entry on oeis.org

7, 29, 67, 191, 277, 947, 1129, 2557, 5779, 8647, 13367, 14029, 16111, 22367, 24977, 31627, 36857, 47279, 64621, 87991, 93097, 96581, 98347, 109279, 126757, 163307, 239087, 282377, 329267, 342379, 352381, 372817, 411779, 448879, 468029, 471907, 491537, 519691, 531997
Offset: 1

Views

Author

Alex Ratushnyak, Nov 16 2013

Keywords

Comments

Triangular(p) = p*(p+1)/2.

Crossrefs

Programs

  • Mathematica
    t = Select[Prime[Range[300]], PrimeQ[# (# + 1)/2 + 1] &]; t*(t + 1)/2 + 1 (* T. D. Noe, Nov 19 2013 *)

Formula

a(n) = A000217(A231847(n))+1.

A343151 Numbers k such that 1+A083266(k) is prime.

Original entry on oeis.org

1, 3, 4, 7, 8, 11, 19, 23, 25, 27, 36, 43, 47, 50, 64, 71, 107, 131, 163, 167, 179, 211, 223, 225, 242, 243, 251, 271, 307, 343, 359, 419, 431, 439, 443, 467, 503, 571, 691, 751, 800, 811, 827, 839, 863, 900, 907, 947, 967, 971, 991, 1019, 1031, 1058, 1063, 1091, 1103, 1187, 1279, 1296, 1331
Offset: 1

Views

Author

J. M. Bergot and Robert Israel, Apr 07 2021

Keywords

Comments

Numbers k such that the sum of divisors of k + the sum of totatives of k is prime.

Examples

			a(4) = 7 is a term because 1+A083266(n) = 29 is prime.
		

Crossrefs

Cf. A083266, A343148. Includes A231847.

Programs

  • Maple
    f:= n -> numtheory:-sigma(n) + n*numtheory:-phi(n)/2: f(1):= 2:
    select(t -> isprime(f(t)), [$1..2000]);
  • Mathematica
    {1}~Join~Select[Range[1331], PrimeQ[DivisorSigma[1, #] + # EulerPhi[#]/2] &] (* Michael De Vlieger, Apr 07 2021 *)

A357218 Primes p such that T(p) - 2 is prime, where T(p) is the triangular number (A000217) with index p.

Original entry on oeis.org

5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 149, 157, 193, 197, 233, 257, 269, 277, 281, 313, 337, 389, 401, 409, 457, 509, 521, 541, 613, 641, 673, 701, 797, 857, 877, 881, 929, 953, 997, 1009, 1033, 1093, 1109, 1117, 1129, 1153, 1193, 1297, 1301, 1373, 1381, 1433, 1481, 1493
Offset: 1

Views

Author

Bernard Schott, Sep 18 2022

Keywords

Comments

T(p) must be odd, so these primes p satisfy p == 1 (mod 4) (A002144).
Corresponding values of T(p)-2 are in A357219.
The first eleven primes == 1 (mod 4) are terms. The smallest Pythagorean prime that is not a term is A002144(12) = 101 because T(101) = 5151 and 5151 - 2 = 5149 = 19 * 271 (see Wells reference).

Examples

			T(5) - 2 = 5*6/2 - 2 = 13, hence 5 is a term.
		

References

  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, Penguin Books, London, England, 1997, entry 496, page 142.

Crossrefs

Subsequence of A002144.

Programs

  • Maple
    filter := p -> isprime(p) and irem(p-1, 4) = 0 and isprime(p*(p+1)/2 -2) : select(filter, [$1 .. 1500]);
  • Mathematica
    Select[Prime[Range[240]], PrimeQ[#*(# + 1)/2 - 2] &] (* Amiram Eldar, Sep 18 2022 *)

A231989 Least prime p such that f(0),...,f(n) are all primes, where f(0) = p, then f(i+1) = triangular(f(i))+1.

Original entry on oeis.org

3, 3, 43, 236367611, 31542795419
Offset: 1

Views

Author

Alex Ratushnyak, Nov 16 2013

Keywords

Comments

Triangular(p) = p*(p+1)/2 (see A034953).

Examples

			a(2) = 3 because 3 is the least prime such that the following are two primes:
  p1 = 3 * 4 / 2 + 1 = 7.
  p2 = 7 * 8 / 2 + 1 = 29.
a(3) = 43 because 43 is the least prime such that the following are three primes:
  p1 = 43 * 44 / 2 + 1 = 947.
  p2 = 947 * 948 / 2 + 1 = 448879.
  p3 = 448879 * 448880 / 2 + 1 = 100746402761.
		

Crossrefs

Showing 1-4 of 4 results.