49464

Appears in sequences

• Aliquot sequence starting at 564.at n=9A014361
• Card-matching numbers (Dinner-Diner matching numbers).at n=23A059058
• Card-matching numbers (Dinner-Diner matching numbers).at n=16A059068
• Number of permutations of n distinct letters (ABCD...) each of which appears thrice with one fixed point.at n=3A124009
• Number of (n+1) X (1+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235169
• Number of (n+1) X (4+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235172
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=6A235175
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=9A235175
• G.f. A(x) satisfies A(x) = 1/( 1 - x*A(x)^(3/2)/(1 - x*A(x)^(3/2)) )^2.at n=6A378670
• a(n) = Sum_{k=0..floor(n/2)} 2^(n-2*k) * binomial(2*k+1,2*n-4*k).at n=17A387649