4197376

Appears in sequences

• Number of strings of length n over GF(4) with trace 0 and subtrace 0.at n=12A073995
• Number of strings of length n over GF(4) with trace 1 and subtrace 0.at n=12A073997
• 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=11A132390
• 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=12A225826
• 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=6A225828
• Number of binary pattern classes in the (6,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=4A225830
• Square array read by antidiagonals: a(m,n) is the number of binary pattern classes in the (m,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=59A225910
• Square array read by antidiagonals: a(m,n) is the number of binary pattern classes in the (m,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=61A225910
• a(n) = 2^(n-2)*(2^(n+4)-(-1)^n+13).at n=10A240526
• 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=23A283433
• Triangle read by rows: T(n,m) is the number of pattern classes in the (n,m)-rectangular grid with 8 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=12A286919
• Numbers n such that phi(n) - 1 | sigma(n).at n=31A291880
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k grid up to horizontal and vertical reflections by a tile that is fixed under horizontal reflection only.at n=39A368218
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k grid up to horizontal and vertical reflections by a tile that is fixed under horizontal reflection only.at n=41A368218
• 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 a tile that is fixed under 180-degree rotation but not horizontal or vertical reflection.at n=39A368219
• 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 a tile that is fixed under 180-degree rotation but not horizontal or vertical reflection.at n=41A368219
• 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=22A368220
• 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=26A368220