98997

Appears in sequences

• a(n) = 3*a(n-1) + 2*a(n-3), with a(0)=1, a(1)=3.at n=10A098589
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=10A149498
• Numbers that require exactly 8 iterations to determine that they are happy or not (A007770 and A031177).at n=21A193996