126491972

Appears in sequences

• Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.at n=36A047992
• Expansion of 2*x*(1 - x)/(1 - 3*x + x^2).at n=20A052995
• Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3,Pi/3,0) (this is the classical modular tessellation).at n=37A054886
• Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term.at n=20A055819
• 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=37A068922
• Numbers with two representations as the sum of two Fibonacci numbers.at n=36A078642
• Number of meaningful differential operations of the n-th order on the space R^6.at n=35A090991
• Number of base 4 n-digit numbers with adjacent digits differing by one or less.at n=19A126358
• Row sums of triangle A131779.at n=37A131780
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.at n=36A163714
• Values of gcd(Fibonacci(n), Fibonacci(n+3)+2) sorted with no repeats.at n=39A178767
• Denominators of A178381(4*n+3)/A178381(4*n+2).at n=19A179133
• a(n) = (F(2*n-1) + F(2*n+2)) * (5/6 - cos(2*Pi*n/3)/3), where F(n) = Fibonacci(n).at n=19A179134
• a(n) = a(n-1) + a(n-2) - (-1)^(a(n-1) + a(n-2)) with a(0)=0, a(1)=1.at n=39A253198
• a(n) = a(n-1) + a(n-2) + (1 + (-1)^(a(n-1) + a(n-2))) with a(0)=0, a(1)=1.at n=39A255978
• a(n) = least m such that 1/2^(n+1) < f(m) < 1/2^n, where f(m) = fractional part of m*(golden ratio).at n=26A283747