46365

Appears in sequences

• a(n) = Fibonacci(n) - 3. Number of total preorders.at n=20A006327
• Related to series-parallel networks.at n=9A006349
• a(n) = Fibonacci(4n)-3, or Fibonacci(2n-2)*Lucas(2n+2).at n=5A081074
• Number of compositions (ordered partitions) of n into powers of 4.at n=35A087221
• G.f. satisfies A(x) = f(x)^2 + x*A(x)*f(x)^3, where f(x) = Sum_{k>=0} x^((4^k-1)/3).at n=11A087224
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j).at n=14A205454
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j).at n=32A205454
• s(k)-s(j), where the pairs (k,j) are given by A205852 and A205853, and s(k) denotes the (k+1)-st Fibonacci number.at n=38A205854
• Poly-Cauchy numbers c_3^(-n).at n=7A223173
• Numbers x such that sigma(x) = sigma(y), with x<>y, where y is the 10's complement mod 10 of the digits of x.at n=17A300447
• a(n) = L(n)*L(n+1) mod F(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.at n=22A348591
• Number of primitive binary words of length n that avoid 11, start with 1 and end with 0.at n=24A381936
• Expansion of e.g.f. exp(x^3/6 * cosh(x)).at n=11A389149