92736

Appears in sequences

• Number of binary vectors of length n containing no singletons.at n=25A006355
• Expansion of e.g.f. arctan(sin(x)*exp(x)).at n=8A012290
• a(n) = 2*Fibonacci(2*n+2).at n=11A025169
• Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 13 (most significant digit on right).at n=25A029506
• Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.at n=21A047992
• Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).at n=22A054886
• a(0) = 1, then twice the Fibonacci sequence.at n=24A055389
• a(n) = 2*Fibonacci(n) - (1 - (-1)^n)/2.at n=24A062114
• a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=46A063827
• Number of ways to tile a 3 X 2n room with 1 X 2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=22A068922
• Numbers with two representations as the sum of two Fibonacci numbers.at n=21A078642
• Number of meaningful differential operations of the n-th order on the space R^6.at n=20A090991
• Expansion of (1+x)^2/(1-x^2-x^4).at n=47A096748
• A Chebyshev transform of (1+3x)/(1-3x).at n=11A099858
• "Rounded hypotenuses": a(n) = round(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=45A104804
• Number of permutations avoiding the patterns {1432,2431,3412,3421,4132,4231,4312,4321}; number of strong sorting class based on 1432.at n=12A111282
• a(n) = 2*F(n-1) = L(n) - F(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively.at n=25A118658
• Expansion of g.f. x*(1+x+x^2)/(1-x-x^2).at n=23A128588
• Expansion of x*(1+2*x)/( (x^2-x-1)*(x^2+x-1) ).at n=23A133586
• First differences of A135992.at n=23A135994