164737

Appears in sequences

• Strong pseudoprimes to base 29.at n=29A020255
• Strong pseudoprimes to base 31.at n=23A020257
• Strong pseudoprimes to base 61.at n=29A020287
• Numerators of continued fraction convergents to sqrt(143).at n=7A041262
• Numerators of continued fraction convergents to sqrt(572).at n=7A042096
• Chebyshev sequence T(n,12) with Diophantine property.at n=4A077424
• Brilliant Sarrus numbers.at n=17A086837
• Squarefree products of factors of Fermat numbers (A023394).at n=26A094358
• a(n) = ChebyshevT(4, n).at n=12A144130
• a(n) = 648*n^2 - 72*n + 1.at n=15A154514
• a(n) = 10368*n^2 - 288*n + 1.at n=3A157288
• a(n) = 128*n^2 - 32*n + 1.at n=35A157331
• a(n) = 128*n^2 + 2528*n + 12481.at n=25A157436
• a(n) = 2048*n^2 - 128*n + 1.at n=8A157448
• Triangle, read by rows, T(n, k) = (2*n)!/((n-k)! * k!)^2 - (2*n)!/(n!)^2 + 1.at n=29A176078
• Triangle, read by rows, T(n, k) = (2*n)!/((n-k)! * k!)^2 - (2*n)!/(n!)^2 + 1.at n=34A176078
• Semiprime 2-pseudoprimes of the form 10k + 7.at n=10A216667
• Heptagonal numbers (A000566) that are semiprimes (A001358).at n=34A259676
• Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=6A300762
• Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=11A316906