150049

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.at n=24A001595
• Number of strong single-component edge-subgraphs in Moebius ladder M_n.at n=5A020870
• a(n) = 2*Fibonacci(n) - (1 - (-1)^n)/2.at n=25A062114
• a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.at n=26A066983
• a(n) = 2*Fibonacci(2*n+1) - 1.at n=12A069403
• Duplicate of A069403.at n=12A085327
• Expansion of (-1-x-x^2-4*x^3-4*x^4+4*x^5+x^6+x^7+x^8) / ((x+1)*(x^2-x+1)*(x^2+x-1)*(x^4-x^3+2*x^2+x+1)).at n=24A108390
• Expansion of (-1-x-x^2-4*x^3-4*x^4+4*x^5+x^6+x^7+x^8) / ((x+1)*(x^2-x+1)*(x^2+x-1)*(x^4-x^3+2*x^2+x+1)).at n=25A108390
• a(n) = A110722(n)/121.at n=19A110723
• Numbers that are the sum of exactly two sets of Fibonacci numbers.at n=43A122194
• Row sums of A128586.at n=26A128587
• Numbers that have 12 terms in their Zeckendorf representation.at n=13A179252
• a(n) = a(n-1) + a(n-2) - (-1)^(a(n-1) + a(n-2)) with a(0)=0, a(1)=1.at n=25A253198
• 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=25A255978
• Discriminants of totally real cubic fields in which every norm-positive unit is totally positive.at n=29A329769