110007

Appears in sequences

• a(1) = 15; then numbers obtained at every stage of division by 3 in the following process: multiply by 3, reverse the digits, divide by 3, reverse the digits, multiply by 3, reverse the digit, divide by 3.at n=5A083823
• Row sums of triangle A104505, which is equal to the right-hand side of the triangle A084610 of coefficients in (1+x-x^2)^n.at n=17A104507
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by something other than 1, starting with 0.at n=17A221543