38239

Properties

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z.at n=26A050787
• Primes of form prime(1) + ... + prime(k) + 1.at n=18A053845
• Primes of the form 6n^2 - 2n - 1.at n=28A099007
• Primes that are the difference of two Lucas numbers; primes in A113191.at n=29A113192
• Numbers k such that the concatenation of k with k+5 gives a square.at n=5A115428
• Numbers k such that k concatenated with k-4 gives the product of two numbers which differ by 6.at n=3A116131
• T(n,m)=Number of (n+1)X5 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=28A189174
• Fibonacci sequence beginning 11, 8.at n=18A206420
• Numerators of upper primes-only best approximates (POBAs) to the golden ratio, phi (A001622); see Comments.at n=16A265798
• The number of vertices inside a cross with width 3 and height n (see Comments in A331455 for definition) formed by the straight line segments mutually connecting all vertices and all points.at n=21A330850
• Slowest increasing sequence of primes such that a(n - 1) + a(n) and a(n - 1)^2 + a(n)^2 are both semiprimes, with a(1)=2.at n=24A365050
• Prime numbersat n=4037