20889

Appears in sequences

• Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=32A015994
• a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=33A023109
• a(n) = T(2n-1, n-1), T given by A026536.at n=8A026545
• a(n) = T(n, floor(n/2)), T given by A026536.at n=17A026547
• Least number of Reverse-then-add persistence n.at n=33A033866
• Denominators of continued fraction convergents to sqrt(387).at n=8A041735
• Numbers whose base-12 representation has exactly 5 runs.at n=8A043654
• The number of odd numbers that require n Collatz (3x+1) iterations to reach 1.at n=51A176866
• Number of nX3 0..2 arrays with no more than floor(nX3/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=6A222568
• T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=42A222573
• Triangle T(n,k), read by rows, giving the numerator of the coefficient of x^k in the Boros-Moll polynomial P_n(x) for n >= 0 and 0 <= k <=n.at n=33A223549
• Numbers n such that prime(n) contains a substring of all the prime digits in order, i.e., "2357".at n=10A295708