47197

Appears in sequences

• a(n) = floor(n*(n-1)*(n-2)*(n-3)/16).at n=31A011926
• Strong pseudoprimes to base 3.at n=14A020229
• Strong pseudoprimes to base 9.at n=35A020235
• Strong pseudoprimes to base 22.at n=16A020248
• Strong pseudoprimes to base 26.at n=16A020252
• Strong pseudoprimes to base 27.at n=32A020253
• Strong pseudoprimes to base 41.at n=22A020267
• Strong pseudoprimes to base 66.at n=18A020292
• Strong pseudoprimes to base 68.at n=33A020294
• Strong pseudoprimes to base 70.at n=27A020296
• Strong pseudoprimes to base 78.at n=21A020304
• Number of n-node rooted identity trees of height at most 7.at n=18A038086
• Base-3 Euler-Jacobi pseudoprimes.at n=24A048950
• Numbers k such that phi(k) is a perfect sixth power.at n=24A078166
• Overpseudoprimes to base 3.at n=7A141350
• Euler pseudoprimes to base 3: composite integers such that abs(3^((n - 1)/2)) == 1 mod n.at n=29A262051
• 10-gonal (or decagonal) numbers with prime indices.at n=28A267217
• Smallest composite c where exactly n composites d with d < c exist such that c^(d-1) == 1 (mod d) and d^(c-1) == 1 (mod c).at n=35A270575
• Semiprimes k = pq such that p^k == p (mod k) and q^k == q (mod k).at n=32A294169
• Super pseudoprimes (or superpseudoprimes) to base 3: Fermat pseudoprimes to base 3 all of whose divisors that are larger than 1 are either primes or Fermat pseudoprimes to base 3.at n=25A328662