26566

Appears in sequences

• a(n) = a(n-2) + 2*a(n-3) + a(n-4).at n=20A036605
• Integers n > 10583 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10583.at n=26A066055
• A129957(n) - n*(n-1)/2.at n=30A129959
• Number of binary strings of length n with no substrings equal to 0001 0100 or 0110.at n=16A164463
• a(n) = prime(n)^2-3.at n=37A182200
• A182642(n) - A107857(n-1) for n>=1.at n=14A182643
• Total number of parts in all overpartitions of n.at n=17A235792
• 6-step Fibonacci sequence starting with (0,0,1,0,0,0).at n=21A251708
• Expansion of x*(1 - x + 2*x^3 - x^4)/((1 - x)*(1 + x)*(1 - x + x^2)*(1 - x - x^2)).at n=22A279890
• a(n) = 2*a(n-1) - a(n-2) + a(n-4) for n>3, a(0)=0, a(1)=a(2)=2, a(3)=3.at n=22A286350
• Numbers k such that 349*2^k+1 is prime.at n=6A322972
• a(n) = n*(n + 5)*(n + 7)*(n + 10)/24 + 1.at n=23A323220
• a(n) is the least positive exponent k such that the decimal expansion of 5^k contains n consecutive zeros.at n=10A329172
• Number of GP-iposets (gluing-parallel posets with interfaces) with n points.at n=6A331159
• Number of palindromic binary strings of length n having no 6-runs of 1's.at n=30A382479
• Lower (3/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=10A387780
• Lower (1/2)-midsequence of F(n) and F(n+4), where F = A000045 (Fibonacci numbers); see Comments.at n=20A390350