89375

Appears in sequences

• Number of walks on square lattice.at n=21A005565
• Numbers k such that S(k)=d(k), where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=33A073307
• Numbers k such that 9*10^k + 4*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=8A103097
• Numbers k such that the k-th triangular number contains only digits {0,3,9}.at n=12A119070
• a(n) = 529*n^2 - 2*n.at n=12A158364
• a(n) = the number of ways that at least two distinct primes <= prime(n) sum to a prime.at n=17A262765
• Triangle T(n,k) (n >= k >= 0) read by rows: T(n,0) = (1+(-1)^n)/2; for k>=1, set T(0,k) = 0, S(n,k) = binomial(n,k)*binomial(n+k+1,k), and for n>=1, T(n,k) = S(n,k)-T(n-1,k).at n=41A331432
• Triangle T(n,k) (n >= k >= 0) read by rows: T(n,0) = (1+(-1)^n)/2; for k>=1, set T(0,k) = 0, S(n,k) = binomial(n,k)*binomial(n+k+1,k), and for n>=1, T(n,k) = S(n,k)-T(n-1,k).at n=49A331432
• a(n) is the least integer h such that there exists a Pythagorean triple whose hypotenuse is h and whose other legs z satisfy A176774(z) = n.at n=11A343981
• Numbers m such that abs(K(m+1) - K(m)) = 1, where K(m) = A002034(m) is the Kempner function.at n=38A346211
• The five digits of a(n) and their four successive absolute first differences are all distinct.at n=74A365257
• Numbers m such that the product m*(m+1) has a set of prime divisors, from greatest down to 2, that is missing exactly one prime divisor.at n=43A391885