1073790976

Appears in sequences

• Number of strings of length n over GF(4) with trace 0 and subtrace 0.at n=16A073995
• Number of strings of length n over GF(4) with trace 1 and subtrace 0.at n=16A073997
• Number of binary pattern classes in the (2,n)-rectangular grid; two patterns are in same class if one of them can be obtained by reflection or rotation of the other one.at n=15A132390
• Number of binary pattern classes in the (2,n)-rectangular grid: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=16A225826
• Number of binary pattern classes in the (4,n)-rectangular grid: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=8A225828
• Number of binary pattern classes in the (8,n)-rectangular grid: two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=4A225832
• a(n) = 2^(n-2)*(2^(n+4)-(-1)^n+13).at n=14A240526
• Number of inequivalent 4 X 4 matrices with entries in {1,2,3,...,n} up to vertical and horizontal reflections.at n=4A283028
• Triangle read by rows: T(n,m) is the number of pattern classes in the (n,m)-rectangular grid with 4 colors and n>=m, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=14A283433
• Numbers n such that phi(n) - 1 | sigma(n).at n=41A291880
• Table read by antidiagonals: T(n,k) is the number of tilings of the n X k grid up to horizontal and vertical reflections by an asymmetric tile.at n=24A368220