65790

Appears in sequences

• a(n) = 2*(2^n + 1)*(2^(n+1) - 1).at n=7A005367
• Number of n-bead black-white reversible strings with fundamental period n.at n=17A045625
• Number of reversible strings with n beads using exactly two different colors.at n=16A056309
• Number of primitive (aperiodic) reversible strings with n beads using exactly two different colors.at n=16A056318
• First of two complementary trees generated by the squares; the other tree is A183421.at n=16A183420
• T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=38A240412
• Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=6A240414
• Number of (n+1) X (7+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.at n=14A250741
• Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039).at n=26A341604