32896
domain: N
Appears in sequences
- Relational systems on n nodes.at n=1A001376
- Number of relations with 4 arguments on n nodes.at n=1A001377
- a(n) = (2^n + 2^[ n/2 ] )/2.at n=14A001445
- a(n) = (4^n + 4^[ n/2 ] )/2.at n=6A001446
- Numbers that are the sum of 3 positive 7th powers.at n=17A003370
- a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=8A003665
- Numbers that are the sum of at most 3 positive 7th powers.at n=32A004865
- Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.at n=16A005418
- a(n) = 2^(n-1)*(1+2^n).at n=8A007582
- Number of points on surface of 4-dimensional cube.at n=16A008511
- a(n) = 4^n*(4^n+1)/2.at n=4A026244
- Number of reversible strings with n beads of 4 colors.at n=8A032121
- Number of rotationally symmetric solutions for queens on n X n board.at n=27A033148
- Dirichlet convolution of b_n=2^(n-1) with itself.at n=14A034733
- a(n) = n^2*(n^2 + 1)/2.at n=16A037270
- Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=17A038503
- Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1".at n=17A038504
- Number of elements of GF(2^n) with trace 0 and subtrace 0.at n=17A038518
- Number of elements of GF(2^n) with trace 1 and subtrace 0.at n=17A038520
- Numbers having four 0's in base 8.at n=22A043424