35422

Appears in sequences

• Number of binary vectors of length n containing no singletons.at n=23A006355
• a(n) = 2*Fibonacci(2*n+2).at n=10A025169
• Gilda's numbers: numbers k such that if a Fibonacci sequence is formed with first term = a certain absolute value between decimal digits in k (A007953) and second term = sum of decimal digits in k (A040997), then k itself occurs as a term in the sequence.at n=23A042947
• Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.at n=19A047992
• Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).at n=20A054886
• a(0) = 1, then twice the Fibonacci sequence.at n=22A055389
• a(n) = 2*Fibonacci(n) - (1 - (-1)^n)/2.at n=22A062114
• a(n) = round(sqrt(a(n-2)^2 + a(n-1)^2)) with a(0) = 1 and a(1) = 2.at n=42A063827
• 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=20A068922
• Numbers with two representations as the sum of two Fibonacci numbers.at n=19A078642
• Number of meaningful differential operations of the n-th order on the space R^6.at n=18A090991
• Expansion of (1+x)^2/(1-x^2-x^4).at n=43A096748
• "Rounded hypotenuses": a(n) = round(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=1, a(2)=3.at n=41A104804
• Number of permutations avoiding the patterns {1432,2431,3412,3421,4132,4231,4312,4321}; number of strong sorting class based on 1432.at n=11A111282
• a(n) = gcd(Lucas(n)+1, Fibonacci(n)-1).at n=42A115314
• a(n) = 2*F(n-1) = L(n) - F(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively.at n=23A118658
• Site series for first parallel moment of Kagome lattice.at n=15A120550
• Expansion of g.f. x*(1+x+x^2)/(1-x-x^2).at n=21A128588
• Expansion of x*(1+2*x)/( (x^2-x-1)*(x^2+x-1) ).at n=21A133586
• First differences of A135992.at n=21A135994