39916

Appears in sequences

• T(n,n-6), where T is the array in A055830.at n=15A055833
• Numbers k such that abs(prime(k)-k*tau(k)) < sqrt(k).at n=34A068543
• Numbers n such that sigma(n) + sigma(n+3) = sigma(n+1) + sigma(n+2).at n=4A076666
• Maximum determinant that can be formed from the optimal set of nonnegative 3 X 3 matrix elements <=n, which maximize the number of different determinants given in A099834.at n=32A099815
• Row sums of triangle A076732.at n=7A193463
• Sum of divisors of n and product of divisors of n are both perfect cubes.at n=11A244428
• Number of length n+1 0..6 arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=4A250417
• T(n,k)=Number of length n+1 0..k arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=49A250419
• Number of length 5+1 0..n arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=5A250422
• a(n) = n*(n + 1)*(13*n^2 + 13*n - 14)/24.at n=16A264888
• Numbers k(n) used for Cassels's Markoff forms MF(n) corresponding to the conjectured unique Markoff triples MT(n) with maximal entry m(n) = A002559(n), for n >= 1.at n=30A305310
• Unique solution x of the congruence x^2 = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3.at n=28A324601
• Characteristic numbers of Markov triples in the binary tree A368546.at n=23A368134