49409

Properties

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=28A050789
• n is prime and is the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 - n_2 = n_3. (Do not allow leading zeros for nonzero n_i.)at n=42A067861
• Primes p such that p*(p-1) divides 3^(p-1)-1.at n=35A081763
• Members of A083989 whose 10's complement is also a member of A083989.at n=35A083991
• Primes p such that p-1 and p+1 are both divisible by fourth powers.at n=29A086709
• Primes of the form 512n+257.at n=18A105131
• Primes of the form 1+2*n+3*n^2.at n=18A122430
• Primes of the form 256*k + 1.at n=36A208178
• Number of 5 X n -1,1 arrays such that the sum over i=1..5,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 5 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=21A225312
• Primes p for which A329697(p) == 3.at n=41A334093
• Primes p such that the 10's complement A089186(p) and the concatenations of p and A089186(p) and of A089186(p) and p are all prime.at n=32A372082
• Primes having only {0, 4, 9} as digits.at n=17A385768
• Primes having only {0, 4, 5, 9} as digits.at n=35A386071
• Primes having only {0, 4, 6, 9} as digits.at n=31A386073
• Primes having only {0, 4, 8, 9} as digits.at n=33A386076
• Prime numbersat n=5076