32431

Appears in sequences

• Add 1, multiply by 1, add 2, multiply by 2, etc., start with 1.at n=14A019463
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 31 ones.at n=11A031799
• Number of rooted planar trees (n+1 nodes) where any 2 subtrees extending from same node are different.at n=13A032028
• a(0)=1, a(n) = n*(a(n-1) + n).at n=7A053817
• Number of terms of A100873 less than 10^n.at n=12A100874
• Number of 7 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 7 X n array.at n=15A220037
• Numbers n such that n divides the concatenation of all divisors in descending order.at n=6A224930
• Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010101 00101011 or 01010101.at n=8A260922
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=36A270327
• Number of compositions of n where the difference between largest and smallest parts equals ten.at n=14A323127
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * (1 + Sum_{j=0..n} j^k/j!).at n=52A368759
• G.f. A(x) satisfies A(x) = 1/( (1-x)^3 * (1 - x*A(x) - 2*x^2*A'(x)) ).at n=5A386264