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

A258897 Divisorial primes p such that p-1 = Product_{d|k} d for some k < sqrt(p-1).

Original entry on oeis.org

331777, 8503057, 9834497, 59969537, 562448657, 916636177, 3208542737, 3782742017, 5006411537, 7676563457, 11574317057, 19565295377, 34188010001, 38167092497, 49632710657, 56712564737, 59553569297, 61505984017, 104086245377, 114733948177
Offset: 1

Views

Author

Jaroslav Krizek, Jun 20 2015

Keywords

Comments

A divisorial prime is a prime p of the form p = 1 + Product_{d|k} d for some k (see A007955 and A258455).
Sequence lists divisorial primes p from A258455 such that p-1 = A007955(k) for some k < sqrt(p-1).
If 1 + Product_{d|k} d for some k > 1 is a prime p other than 3, then p-1 is a square and p is either of the form k^2 + 1 or h^2 + 1 where h>k. In this sequence are divisorial primes of the second kind. Divisorial primes of the first kind are in A258896.
With number 3, complement of A258896 with respect to A258455.
With numbers 2 and 3, divisorial primes p that are not of the form 4*q^2 + 1 where q = prime.
See A259023 - numbers n such that Product_{d|n} d is a divisorial prime from this sequence.

Examples

			Prime p = 331777 is in sequence because p - 1 = 331776 = 576^2 is the product of divisors of 24 and 24 < 576.
		

Crossrefs

Programs

  • Magma
    Set(Sort([&*(Divisors(n))+1: n in [1..1000] | &*(Divisors(n)) ne n^2 and IsSquare(&*(Divisors(n))) and IsPrime(&*(Divisors(n))+1)]));
    
  • Magma
    [n: n in [A258455(n)] | not IsPrime(Floor(Sqrt(n-1)) div 2)];

A259021 Numbers k such that k^2 = Product_{d|k} d (= A007955(k)) and simultaneously k^2 + 1 is a divisorial prime (A258455).

Original entry on oeis.org

1, 6, 10, 14, 26, 74, 94, 134, 146, 206, 314, 326, 386, 466, 634, 674, 1094, 1174, 1294, 1306, 1354, 1366, 1546, 1654, 1766, 1774, 1894, 1966, 2026, 2126, 2174, 2326, 2594, 2654, 2746, 2974, 2986, 3046, 3106, 3134, 3214, 3254, 3274, 3314, 3326, 3334, 3446
Offset: 1

Views

Author

Jaroslav Krizek, Sep 01 2015

Keywords

Comments

First deviation from A259020 is at a(15).
With number 2 complement of A259023 with respect to A118369.
1 together with squarefree semiprimes (A006881) k such that k^2 + 1 is prime. Without the squarefree restriction there will be only one more term, 4. - Amiram Eldar, Sep 25 2022

Examples

			The number 10 is in sequence because 10^2 = 1*2*5*10 = 100 and simultaneously 101 is prime.
		

Crossrefs

Union of {1} and (intersection of A005574 and A006881).
Subsequence of A007422, A048943, A259020, A118369.

Programs

  • Magma
    [Floor(Sqrt(n-1)): n in [1..10000000] | IsPrime(n) and n-1 eq (&*(Divisors(Floor(Sqrt(n-1)))))];
    
  • Mathematica
    Prepend[2*Select[Prime[Range[2, 300]], PrimeQ[4 #^2 + 1] &], 1] (* Amiram Eldar, Sep 25 2022 *)
  • Sage
    a = [n for n in range(1,100000) if is_prime(n^2+1) and n^2==prod(list(divisors(n)))] # Danny Rorabaugh, Sep 21 2015

Formula

a(n) = 2*A052291(n) for n > 1. - Amiram Eldar, Sep 25 2022

A259020 Numbers k such that k^2 + 1 is a divisorial prime (A258455).

Original entry on oeis.org

1, 6, 10, 14, 26, 74, 94, 134, 146, 206, 314, 326, 386, 466, 576, 634, 674, 1094, 1174, 1294, 1306, 1354, 1366, 1546, 1654, 1766, 1774, 1894, 1966, 2026, 2126, 2174, 2326, 2594, 2654, 2746, 2916, 2974, 2986, 3046, 3106, 3134, 3136, 3214, 3254, 3274, 3314, 3326
Offset: 1

Views

Author

Jaroslav Krizek, Sep 01 2015

Keywords

Comments

The divisorial primes are primes of the form p = 1 + Product_{d|k} d = 1 + A007955(k) for some k.
Supersequence of A259021. Subsequence of A005574. First deviation from A259021 is at a(15).

Examples

			The number 6 is in sequence because prime 37 = 6^2 + 1 is prime of the form p = 1 + Product_{d|k} d = 1 + A007955(k) for k = 6.
		

Crossrefs

Programs

  • Magma
    Set(Sort([1] cat [Floor(Sqrt(&*(Divisors(n)))): n in [3..10000] | IsPrime(&*(Divisors(n))+1)]));
Showing 1-3 of 3 results.