18468
domain: N
Appears in sequences
- Numbers having four 4's in base 8.at n=8A043440
- T(n,6), array T as in A050186; a count of aperiodic binary words.at n=12A050191
- Numbers n such that 137*2^n-1 is prime.at n=11A050594
- T(2n+6,n), array T as in A050186; a count of aperiodic binary words.at n=6A051199
- Low-temperature specific heat expansion for Kagome net (Potts model, q=4).at n=5A057404
- Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.at n=37A069188
- First differences (A131771) equal this sequence with terms repeated at positions: {m*(m+1)/2, m>=0}.at n=26A131770
- First differences (A131772) equal this sequence with zeros inserted at positions {m*(m+1)/2, m>=0}.at n=32A131771
- Partial sums (A131771) equal this sequence excluding zeros located at positions {m*(m+1)/2, m>=0}, with a(0)=1.at n=39A131772
- Egyptian fraction representation for the cube root of 47.at n=3A132522
- Number of polyominoes with n cells that have the symmetry group D_8.at n=64A142886
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=47A146765
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=52A146765
- Triangle T(n,k,p,q) = (p^n + q^n)*A001263(n, k) with p=2 and q=1, read by rows.at n=37A155537
- Triangle T(n,k,p,q) = (p^n + q^n)*A001263(n, k) with p=2 and q=1, read by rows.at n=43A155537
- Numbers p^5*q^2*r where p, q, r are 3 distinct primes.at n=34A179691
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=15A202195
- Triangle of sums of the first k n-th powers multiplied by binomial(n,k), read by rows.at n=47A215078
- Numbers k such that Sum_{i=1..k} i' == 0 (mod k), where i' is the arithmetic derivative of i.at n=6A229501
- T(n,k)=Number of nXk 0..6 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 7, and upper left element zero.at n=47A230686