56033
domain: N
Appears in sequences
- Strong pseudoprimes to base 8.at n=28A020234
- Strong pseudoprimes to base 13.at n=18A020239
- Strong pseudoprimes to base 31.at n=13A020257
- Strong pseudoprimes to base 43.at n=22A020269
- Strong pseudoprimes to base 55.at n=20A020281
- Strong pseudoprimes to base 58.at n=27A020284
- Strong pseudoprimes to base 66.at n=20A020292
- Strong pseudoprimes to base 70.at n=29A020296
- Strong pseudoprimes to base 79.at n=29A020305
- Strong pseudoprimes to base 84.at n=18A020310
- Strong pseudoprimes to base 94.at n=19A020320
- Strong pseudoprimes to base 95.at n=17A020321
- Number of below-diagonal paths from (0,0) to (n,n) using steps (1,0), (0,1) and (2k-1,1), k a positive integer.at n=8A133656
- Numbers for which the root mean square of nontrivial divisors is an integer and which are not a square of prime numbers.at n=49A247137
- Octagonal numbers (A000567) that are semiprimes (A001358).at n=16A259677
- Euler pseudoprimes to base 5: composite integers such that abs(5^((n - 1)/2)) == 1 mod n.at n=32A262052
- Octagonal numbers with prime indices.at n=32A267144
- Cyclops octagonal numbers: a(n) = n*(3*n-2) with one "zero" digit in the middle.at n=8A285767
- Odd numbers k > 1 such that gcd(5,k) = 1 and 5^((k-1)/2) == -(5/k) (mod k), where (5/k) is the Jacobi symbol (or Kronecker symbol); Euler pseudoprimes to base 5 (A262052) that are not Euler-Jacobi pseudoprimes to base 5 (A375914).at n=8A375816