60813
domain: N
Appears in sequences
- If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2.at n=24A001224
- Expansion of 1/((1-x)^3 (1-x^2)^2 (1-x^3) (1-x^4)).at n=29A002626
- Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.at n=21A046453
- Triangle of rooted planar maps up to orientation-preserving isomorphisms.at n=72A046653
- a(n) = (Fibonacci(2*n)-(-1)^n*Fibonacci(n))/2.at n=13A049602
- Number of positive rational knots with 2n+1 crossings.at n=12A051450
- Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).at n=24A060312
- Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=24A068928
- Duplicate of A001224.at n=25A102526