18932
domain: N
Appears in sequences
- Number of partitions of n into parts not of the form 15k, 15k+7 or 15k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=40A035961
- Denominators of continued fraction convergents to sqrt(518).at n=8A041991
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=34A090789
- a(n) = sigma_3(n) - sigma_2(n).at n=25A092349
- Triangle of 4 - restricted Eulerian numbers as polynomials used in exponential data smoothing: m(p,k,x)=((-1)^k*(1 - x)^(p + k)/(k!(p - 1)!))*Sum[(p - 1 + j)!*j^k*x^j/(j!), {j, 0, Infinity}]/x;n=6; t(m,l)=coefficients((-1)^m*m!*M[n, m, x])/n.at n=18A152249
- Triangle T(n, k) = [x^k] p(n, x), where p(n, x) = (1/n)*(1-x)^(2*n) * Sum_{j >= 0} binomial(n+j-1, j) * j^n * x^(j-1).at n=18A152260
- Partial sums of A160410.at n=26A160799
- Number of nX6 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=4A166791
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^2*x(i)^2 equal to n^2*4.at n=17A184233
- Number of partitions p of n such that (number of numbers of the form 3k+2 in p) is a part of p.at n=38A241548
- Number of length-4 0..n arrays with no following elements larger than the first repeated value.at n=10A267472
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 345", based on the 5-celled von Neumann neighborhood.at n=30A271295
- T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=46A297506
- Number of 2 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=8A297507
- Expansion of Sum_{k>0} (1/(1 - k*x^k)^2 - 1).at n=20A362683