48817

Properties

Appears in sequences

• Fourth term of strong prime sextets: p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1).at n=16A054816
• If a,b are prime numbers satisfying the Diophantine equation a^3+b^3=c^2, then a is -1 mod 12 and b is 1 mod 12, or vice versa. Choose 'b' to be 1 mod 12. This is the sequence of 'b' values, sorted by the magnitude of c.at n=4A099807
• Primes of the form 47*n^2 - 1701*n + 10181.at n=27A128878
• Prime numbers n such that n = p1^3 + p2^3 + p3^3, a sum of cubes of 3 distinct prime numbers.at n=24A137365
• Subsequence of A137365 where it is possible to choose p1, p2, p3 so that p1+p2+p3 = prime.at n=22A137366
• Values of q in A145767.at n=5A145798
• Primes p of the form |prime(n+2)^2-prime(n+1)^2-prime(n)^2|, (absolute values).at n=21A176134
• a(n) = 7*b_7(n) + 6, where b_7 lists the indices of zeros of the sequence u(n) = abs(u(n-1) - gcd(u(n-1), 7n-1)), u(1) = 1.at n=4A186259
• Expansion of e.g.f.: exp(x*(1+x)^x).at n=9A202152
• Variation of Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, make k passes removing every k-th term of the sequence remaining after the previous sieving step; iterate.at n=8A247105
• Number of ways to select a subset s containing n from {1,...,n} and then partition s into blocks of equal size.at n=11A262321
• Values of abs(P(x)), with P(x) = (1/72)*x^6 + (1/24)*x^5 - (1583/72)*x^4 - (3161/24)*x^3 + (200807/36)*x^2 + (97973/3)*x - 11351, for -45 <= x <= 12, sorted by size. All values in the given range are prime.at n=7A330364
• Lesser p of a sexy prime pair such that (p-3)/2 is also the lesser prime of a sexy prime pair.at n=27A358571
• Prime numbersat n=5020