24478

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=21A000211
• Number of (marked) cyclic n-bit binary strings containing no runs of length > 2.at n=20A007040
• Number of maximum matchings in the n-Moebius ladder M_n.at n=21A020878
• Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=21A048162
• Let (A,B)=(a(2*n),a(2*n+1)), then (A,B) is (even,odd), gcd(A,B)=1 and A^2 + B^2 = 5^n. Note: a(0)=0.at n=34A098122
• a(n) is the number of perfect matchings of an edge-labeled 2 X (2n+1) Mobius grid graph.at n=10A162483
• Values of x such that x^2 + y^2 = 5^n with x and y coprime and 0 < x < y.at n=16A230710
• Number of (n+1)X(1+1) 0..3 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=3A237204
• Number of (n+1)X(4+1) 0..3 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=0A237207
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=6A237211
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=9A237211
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 533", based on the 5-celled von Neumann neighborhood.at n=28A272784