19653

Appears in sequences

• Least m such that if r and s in {1/1, 1/4, 1/9,..., 1/n^2} satisfy r < s, then r < k/m < s for some integer k.at n=37A024827
• Smallest m such that A065623(m) = n.at n=19A065624
• Number of primes of the form 8k+3 less than 10^n.at n=5A091127
• a(n) = least k such that the remainder when 27^k is divided by k is n.at n=29A128367
• Values of z in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z arranged in order of increasing x.at n=25A138669
• a(n) = 68*n^2 + 1.at n=17A158732
• Last term where no prime sums occur in A161190 in a 4-diagonal set of 24 terms.at n=8A161193
• Number of nonisomorphic graded posets with 0 and 1 and non-uniform Hasse graph of rank n, with exactly 2 elements of each rank level between 0 and 1.at n=10A208736
• Greatest number (in decimal representation) with n nonprime substrings in base-3 representation (substrings with leading zeros are considered to be nonprime).at n=26A217113
• Number of partitions of n^3 into at most two parts.at n=34A274324
• Where record values occur in A276781, when starting from A276781(2)=1.at n=44A276782
• a(n) is the smallest integer k > n such that (k+1)(k+2)...(2k-2n+1)/(k(k-1)...(k-n+1)) is an integer.at n=43A290791
• Number of integer compositions of n into odd parts covering an initial interval of odd positive integers.at n=23A356604
• a(n) = 2 + n^2*floor((n+3)/2) + floor(3*n/2).at n=32A370754
• Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete tripartite graph using exactly k interchangeable colors, 3 <= k <= 3*n.at n=26A385432
• Odd semiprimes p*q, such that Stern polynomial B(p*q,x) is a product of B(p,x) and B(q,x).at n=45A391256
• Numbers k such that the abundancy index of sigma(k) divided by the abundancy index of d(k) equals a whole number.at n=15A392507