308351

Appears in sequences

• Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 0,0,0,1,1,1,1 for x=0,1,2,3,4,5,6.at n=6A198051
• Number of steps needed when starting from (3^(n+1))-1 and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k) to encounter the first number whose base-3 representation begins with a digit other than 2.at n=14A261237