57194

Appears in sequences

• Triangle of number of permutations of [n] with 0 successions, by number of rises.at n=32A046740
• Numbers n such that the smallest possible number of multiplications required to compute x^n is by 2 less than the number of multiplications obtained by Knuth's power tree method.at n=6A115614
• G.f.: A(x) = exp( 2*Sum_{n>=1} A006519(n)^2 * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=21A162581
• Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j,-n)*E1(j,k), E1 the Eulerian numbers A173018, for n>=0 and 0<=k<=n.at n=50A271698
• Expansion of 1/(2 - Product_{k>=1} (1 + k*x^k)).at n=11A307063