50621

Appears in sequences

• a(n) = (6*n+1)*(6*n+5).at n=37A001513
• Numbers k such that x^k + x^2 + 1 is irreducible over GF(2).at n=18A057460
• Brilliant numbers k such that 2k+1 is also brilliant.at n=35A085649
• Product of the n-th cousin prime pair.at n=14A143206
• a(n) = 100*n^2 + 100*n + 21.at n=22A152161
• Numbers k such that exactly one d, 2 <= d <= k/2, exists which divides binomial(k-d-1, d-1) and is not coprime to k.at n=23A178071
• Number of 2X3 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 2 zero-sum 3-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=26A192698
• Number of zero-sum -n..n arrays of 6 elements with first through fourth differences also in -n..n.at n=10A201441
• Increasing a(n)is the smallest number of the form p^a*q^b, where a,b are positive integers and p < q are odd primes such that max( p^a, q^b)/min( p^a, q^b) <= 1 + 2/prime(n).at n=25A229108
• Sequence of pairwise relatively prime numbers of class P_3 (see comment).at n=24A275246
• Positions of records in A329040.at n=34A329051
• Triangle read by rows: T(n,k) = arithmetic derivative of ((A002110(n) + A002110(k)) / A002110(k)), 1 <= k <= n.at n=40A370136