36888

Appears in sequences

• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 16.at n=24A031694
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=22A050791
• Sum of the first n^2 primes.at n=11A109724
• Subsequence of 'Fermat near misses' which is generated by a simple formula based on the cubic binomial expansion along with formulas for the corresponding terms in the expression, x^3 + y^3 = z^3 + 1.at n=7A141326
• a(n) = 256*n^2 + 2*n.at n=11A158230
• a(n) = 576*n^2 + 24.at n=8A158637
• Constant term of the reduction of the n-th 2nd-kind Chebyshev polynomial by x^2 -> x+1.at n=10A192235
• Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles.at n=28A193068
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+487)^2 = y^2.at n=8A207076
• Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0.at n=21A211630
• Records in A096335 (values).at n=40A221181
• Terms of A007504 divisible by 3.at n=38A249679
• Number of length n+6 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=12A256821
• Number of length n+7 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=10A256822
• The sum S of the maximum number of consecutive primes starting with 2 such that S <= prime(n)^2.at n=43A346134
• a(n) is the smallest integer k > 2*n such that Product_{i=1..n} (k - i) has no prime factor p in n < p < 2*n.at n=27A386620