46648
domain: N
Appears in sequences
- Partial sums of A084570.at n=31A084569
- Triangle read by rows: T(n,k) is the number of k-matchings of the corona L'(n) of the ladder graph L(n)=P_2 X P_n. and the complete graph K(1); in other words, L'(n) is the graph constructed from L(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=54A102435
- Triangle read by rows: T(n,k) is the number of k-matchings of the corona L'(n) of the ladder graph L(n)=P_2 X P_n. and the complete graph K(1); in other words, L'(n) is the graph constructed from L(n) by adding for each vertex v a new vertex v' and the edge vv'.at n=58A102435
- Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=22A156954
- a(n) = 64*n^2 - 8.at n=26A158487
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape P; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=41A247706
- a(n) = n^3 - 8.at n=36A259348
- Coefficient of x^n in Product_{k>=1} ((1 + x^k) / (1 - x^k))^(k^n).at n=5A270923
- Number of n X 4 0..1 arrays with every element equal to 0, 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero.at n=15A298490
- Cycle lengths obtained by repeated application of the distance-minimizing variant of the strip bijection for the square lattice described in A367150.at n=30A367146