32791
domain: N
Appears in sequences
- Strong pseudoprimes to base 9.at n=31A020235
- a(n) = T(n,n+3), array T as in A047130.at n=8A047138
- (1/2)*(n^2+n+2)*(n^2+3*n+1).at n=15A058310
- First primitive GF(2)[X] polynomials of degree n with exactly 5 terms.at n=14A132451
- a(n) = n^4 - 10n^3 + 35n^2 - 48n + 23.at n=15A137864
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x>=2y+2z.at n=22A212565
- Pseudoprimes to base 3 that are not squarefree.at n=6A244065
- Numbers such that antisigma(n) mod sigma(n) = phi(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and phi(n) is the Euler totient function of n.at n=13A272338
- Pseudoprimes to base 9 that are not squarefree.at n=31A306448
- Pseudoprimes to base 3 that are not squarefree, including the non-coprime pseudoprimes.at n=7A306452
- Number of maximal subsets of {1..n} such that it is possible to choose a different binary index of each element.at n=24A370640
- Numbers that can be written as a^2 + 3*b^2 for some a, b in A155716 and also as c^2 + 6*d^2 for some c, d in A092572.at n=27A380295