141155

Appears in sequences

• For p = prime(n), a(n) is the smallest N such that pN is a base-2 pseudoprime (that is, 2^(pN-1) = 1 mod pN).at n=39A086000
• Numerator of Bernoulli(n, 5/11).at n=7A159250
• Composite numbers n such that b^(n+1) == 1 (mod n) for every b coprime to n.at n=26A208728
• Least composite squarefree numbers k > n such that p + n divides k - n, for each prime p dividing k.at n=34A382484