89898

Appears in sequences

• Royal paths in a lattice.at n=7A006320
• Triangular array read by rows associated with Schroeder numbers: T(1,k) = 1; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=52A033877
• Smallest palindrome with digit sum = n.at n=42A062388
• Triangular array associated with Schroeder numbers: T(0,0) = 1, T(n,0) = 0 for n > 0; T(n,k) = 0 if k < n; T(n,k) = T(n,k-1) + T(n-1,k-1) + T(n-1,k).at n=63A106579
• Palindromic admirable numbers.at n=29A109759
• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x).at n=37A110098
• Palindromes sandwiched between twin primes.at n=17A113838
• a(1)=1, a(2)=3, a(3)=8; for n>=4, a(n) = 10*a(n-3) + 8 (if a(n-3) is odd) or + 9 (if a(n-3) is even).at n=14A117713
• Riordan array (1, x*f(x)) where f(x)is the g.f. of A006318.at n=58A122538
• G.f.: A(x) = 1 + x*A(x)*A(-x) + x^2*exp( Sum_{n>=1} 2*L(n)^2*x^(2*n)/n ), where A(x) = exp(Sum_{n>=1} L(n)*x^n/n).at n=30A205566
• a(n) is the largest n-digit palindromic integer surrounded by twin primes, if one exists, or 0 otherwise.at n=4A218343
• Numbers whose smallest decimal digit is 8.at n=36A284069