393212

Appears in sequences

• a(n) = 4*(2^(n^2-n+1)*(n^2-n)-n+3).at n=3A087487
• Start with 1, then alternately double or add 2.at n=33A099942
• Binomial transform of [1, 1, 5, 1, 5, 1, 5, ...].at n=17A131128
• Positions of zeros in A165477.at n=5A165478
• a(n) = Least i in range [A165478(n),A165478(n+1)] for which abs(A165477(i)) gets the maximum value in that range.at n=5A165479
• a(n) is one fourth of the total number of free ends of 4 line segments expansion at n iterations (see Comments lines for definition).at n=33A238549
• Expansion of x*(1 - x + 4*x^2) / ((1 - x)*(1 - 2*x)).at n=18A296954
• a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.at n=33A347789