19343
domain: N
Appears in sequences
- Quadruples of different integers from [ 1,n ] with no global factor.at n=27A015622
- Quadruples of different integers from [ 2,n ] with no global factor.at n=27A015627
- Products p^3 or p^2*q, where {p,q} are consecutive primes.at n=26A033477
- Decimal part of n-th root of a(n) starts with digit 6.at n=19A034083
- Numbers having exactly two distinct prime factors p, q with q = p+6.at n=39A143205
- Numbers k such that between k and the next prime there are gpf(k) numbers, where gpf(k) denotes the largest prime factor of k.at n=15A235425
- Number of partitions p of n such that floor(mean(p)) and ceiling(mean(p)) are parts of p.at n=42A241340
- a(n) = 23*n^2.at n=29A244632
- Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^(p-1) == 1 (mod p^2) and q = prime(n+1) satisfies b^(q-1) == 1 (mod q^2).at n=24A259075
- a(0)=0, then a(n) = smallest odd k > a(n-1) such that 6*k^prime(n)-1 is prime.at n=43A283676
- Numbers p^2*q, p > q odd primes such that q does not divide p-1, and q does not divide p+1.at n=35A350421
- Sum over all partitions of [n] of the number of blocks containing their own index when blocks are ordered with decreasing largest elements.at n=9A350648
- Number of integer partitions of n whose parts do not have weakly decreasing numbers of prime factors (A001222).at n=40A358910
- Square array A(n,k), read by descending antidiagonals, where A(1, k) = A388984(k), and for n > 1, A(n, k) = A003961(A(n-1), k).at n=53A388981