78080

Appears in sequences

• Expansion of cosh(sin(x))/cos(x).at n=5A009144
• Expansion of exp(sin(x))/cos(x).at n=10A009207
• a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=3.at n=15A080878
• Trinomial transform of the Fibonacci numbers (A000045).at n=7A082761
• Number of triangles in an n X n unit grid that have minimal possible area (of 1/2).at n=18A088658
• Number of partitions of n such that the least part occurs with even multiplicity.at n=48A096374
• Row sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907).at n=14A099603
• G.f.: Sum_{n>=0} 2^(n^2)*(1 + 2^n*x)^n*x^n.at n=4A168480
• Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 7).at n=13A322297
• Number of length-n phone numbers that can be dialed by a chess knight on a 0-9 keypad that starts on any number and takes n-1 steps.at n=11A327692
• a(n) = Sum_{i=1..n, j=1..n, gcd(i,j)=2} (n+1-i)*(n+1-j).at n=36A331761
• T(m,n) is the number of suitably connected m X n Legendrian mosaics read by rows, with 1<=n<=m.at n=30A375354