152551

Appears in sequences

• Differences between two positive cubes in exactly 3 ways.at n=3A014441
• Strong pseudoprimes to base 3.at n=27A020229
• Sum of two (possibly negative) cubes in at least 3 ways.at n=19A051383
• Numbers m such that exactly half of the a such that 0<a<m and (a,m)=1 satisfy a^(m-1) == 1 (mod m).at n=26A191311
• Numbers in A191311 but not in A129521.at n=12A191592
• Differences between two positive cubes in more than two ways.at n=3A265625
• Sum of two (possibly negative) cubes in at least 3 ways (primitive solutions).at n=10A293650
• Sum of two (possibly negative) coprime cubes in at least 3 ways, but not the sum of 2 noncoprime cubes.at n=2A293651
• a(n) is the least integer m such that A001006(m) is divisible by prime(n)^2 or -1 if no such m exists.at n=46A354293
• Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2.at n=7A360184
• Composite numbers k == 5, 7 (mod 12) such that 3^((k-1)/2) == -1 (mod k).at n=11A375918