32816
domain: N
Appears in sequences
- Number of sum-free subsets of {1, ..., n}.at n=23A007865
- Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=42A035974
- Numbers having four 0's in base 8.at n=19A043424
- Number of ordered rooted trees with n generators.at n=7A108524
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+12*x+x^2)/(1-x)^4, read by rows.at n=38A166343
- Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)^(n+1)*p(n, x)/x, p(n, x) = x*D( p(n-1, x) ), with p(1, x) = x/(1-x)^2, p(2, x) = x*(1+x)/(1-x)^3, and p(3, x) = x*(1+12*x+x^2)/(1-x)^4, read by rows.at n=42A166343
- Solutions y of the Mordell equation y^2 = x^3 - 3a^2 - 1 for a = 0,1,2, ... (solutions x are given by A053755).at n=16A173200
- Exponential Riordan array (e^(x), x*A000108(x)).at n=41A185946
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=20A192967
- Augmentation of the triangular array |A123191|. See Comments.at n=44A193559
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 606", based on the 5-celled von Neumann neighborhood.at n=43A273206
- Triangle read by rows. Inverse of the convolution triangle of A108524, the number of ordered rooted trees with n generators.at n=37A357585