150851

Appears in sequences

• Divisors of 2^50 - 1.at n=31A003554
• Sarrus numbers k such that k-1 and k+1 have the same number of prime divisors (counted with multiplicity).at n=6A086806
• Brilliant Sarrus numbers.at n=15A086837
• Pseudoquadprimes: p+4 for primes p where p+4 divides p^(p+4) + 4 and p+4 is composite.at n=16A100875
• Egyptian fraction representation for the cube root of 17.at n=3A132493
• Pseudoprimes to base 2 of the form 4k+3.at n=11A177884
• Composite numbers m such that (4^m - 2^m + 8*m^2 - 2) / (2*m*(2*m + 1)) is an integer.at n=9A235540
• Fermat pseudoprimes (A001567) that are the sum of three consecutive primes.at n=2A270639
• Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=4A300762
• Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=9A316906
• Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=7A316907
• Lucasian pseudoprimes: composite numbers k such that 2^(k-1) == k+1 (mod k(2k+1)).at n=0A343679
• Coefficient of x^n in the expansion of ( (1+x) / (1-x^3)^3 )^n.at n=10A370216