19338

Appears in sequences

• a(n) = Sum_t t*F(n,t), where F(n,t) (see A095133) is the number of forests with n (unlabeled) nodes and exactly t trees.at n=13A005196
• a(n) = floor( Gamma(n + 3/4)/Gamma(3/4) ).at n=8A020086
• First differences of A001628 (Fibonacci convolution).at n=14A055243
• Numbers n for which there are exactly seven k such that n = k + reverse(k).at n=39A072431
• Numerators of average numbers of trees in a forest on n nodes.at n=13A095131
• Numbers k such that N*2^k - 1 is prime where N = 9999999999999999999999988888888888888888887777777777777777766666666666665555555555544444443333322211.at n=4A098466
• Third entry in row n of triangle in A169950.at n=23A169953
• Number of ordered septuples of distinct pairwise coprime positive integers with largest element n.at n=39A186978
• Number of partitions of n with difference 3 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=42A242694
• Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=13A250758
• Number of length n+3 0..2 arrays with at most one downstep in every 3 consecutive neighbor pairs.at n=6A255102
• T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.at n=42A255107
• Number of length n+7 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=2A255114
• a(n) = 2*A002309(n).at n=4A259319
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 62", based on the 5-celled von Neumann neighborhood.at n=36A270081
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=34A271010
• Number of n X 2 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=8A281050
• T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=53A281056
• a(n) is the total number of all winning moves for all partitions of n which represent Chomp positions.at n=33A284686
• Numbers with more than one Collatz tripling step whose odd Collatz trajectory does not contain primes.at n=25A319936