65546

Appears in sequences

• a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=48A085688
• Number of n-node triangulations of the triple torus S_3 in which every node has degree >= 4.at n=2A129039
• 1/4 the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=30A209725
• a(n) = 2^n + 10.at n=16A246139
• Numbers k such that m=2*k is the middle side in a Heronian triangle with sides m-13, m , m+13.at n=21A293817