51552
domain: N
Appears in sequences
- Numbers that have exactly eight prime factors counted with multiplicity (A046310) whose digit reversal is different and also has 8 prime factors (with multiplicity).at n=5A109028
- Sequence of Mahler coefficients of the Gray code function.at n=16A109629
- Triangle T(n, k) = binomial(2*k, k)*binomial(n+k, n-k) + binomial(2*n-k, k)*binomial(2*(n-k), n-k), read by rows.at n=37A156763
- Triangle T(n, k) = binomial(2*k, k)*binomial(n+k, n-k) + binomial(2*n-k, k)*binomial(2*(n-k), n-k), read by rows.at n=43A156763
- Positions of partition numbers in the EKG sequence.at n=41A159032
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=42A184322
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101.at n=5A260471
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101.at n=3A260473
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101.at n=39A260475
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101.at n=41A260475
- Expansion of Sum_{k>=2} x^prime(k) / (1 - Sum_{k>=2} x^prime(k))^2.at n=39A281853
- Integers m that satisfy tau(m) + omega(m) = #({phi(x) = m}).at n=25A305656
- Number of permutations sigma of [n] such that i divides Product_{k=1..i} sigma(k) for 1 <= i <= n.at n=9A333892