111361
domain: N
Appears in sequences
- Strong pseudoprimes to base 3.at n=24A020229
- Strong pseudoprimes to base 20.at n=31A020246
- Strong pseudoprimes to base 26.at n=27A020252
- Strong pseudoprimes to base 29.at n=25A020255
- Strong pseudoprimes to base 37.at n=29A020263
- Strong pseudoprimes to base 41.at n=36A020267
- Strong pseudoprimes to base 47.at n=29A020273
- Strong pseudoprimes to base 60.at n=31A020286
- Strong pseudoprimes to base 62.at n=37A020288
- Strong pseudoprimes to base 78.at n=31A020304
- Strong pseudoprimes to base 87.at n=35A020313
- Hilltop maps: number of n X 1 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..3 n X 1 array.at n=16A218189
- Octagonal numbers (A000567) that are semiprimes (A001358).at n=21A259677
- Triangle read by rows: T(n,k) is the k-th Lie-Betti number of the Fibonacci trees of order n >= 2.at n=36A368135
- Triangle read by rows: T(n,k) is the k-th Lie-Betti number of the Fibonacci trees of order n >= 2.at n=39A368135
- Composite numbers k == 1, 11 (mod 12) such that 3^((k-1)/2) == 1 (mod k).at n=29A375917