18936
domain: N
Appears in sequences
- Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).at n=34A059681
- a(n) = 1458*n - 18.at n=12A157508
- Half the number of nX6 binary arrays with no element unequal to a strict majority of its king-move neighbors.at n=9A183390
- Number of partitions of n^2 into at most 9 square parts.at n=33A255213
- Indices of the start of 10 successive distinct digits in the decimal expansion of e (2.718281828...).at n=15A258166
- Number of positive subset sums of integer partitions of n.at n=21A276024
- a(n) is the sum of quadratic nonresidues of A002145(n) (the n-th prime == 3 mod 4).at n=29A282036
- Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic nonresidues mod p.at n=14A282043
- The PDO_t(n) function (Number of tagged parts over all the partitions of n with designated summands in which all parts are odd).at n=31A293422
- Expansion of e.g.f. exp(x^2/2 * (exp(x) - 1)).at n=9A354000
- Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x^k/k! * (exp(x) - 1)).at n=75A355650
- 32-gonal numbers: a(n) = n*(15*n-14).at n=36A360436