32960

Appears in sequences

• Compose the natural numbers with themselves, A(x) = B(B(x)) where B(x) = x/(1-x)^2 is the generating function for natural numbers.at n=9A030267
• Numbers having four 0's in base 8.at n=23A043424
• Triangle T(n,k) read by rows: the coefficient [x^n] of x^2/(1-(k+1)*x-x^3) in row n, columns 0 <= k <= n.at n=35A117716
• Number of 0's in odd position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=19A129720
• Row sums of triangle A134511.at n=19A134512
• a(1)=1. a(n) = the smallest integer >a(n-1) such that both a(n) and the number of divisors of a(n) contain the same number of 1's in their binary representations as n has when written in binary.at n=10A162955
• Number of regular octahedra that can be formed using the points in an (n+1)X(n+1)X(n+1) lattice cube.at n=16A178797
• Number of (n+1) X 8 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=12A205192
• Triangle of coefficients of polynomials u(n,x) jointly generated with A210740; see the Formula section.at n=64A210739
• Number of n-node rooted trees with a forbidden limb of length 10.at n=13A255640
• Row sums of A285118: a(n) = Sum_{k=1..(n-1)} (C(n-1,k-1) bitwise-and C(n-1,k)), a(0) = a(1) = 0.at n=17A285115
• Number of rooted trees with n nodes such that no more than nine subtrees of the same size extend from the same node.at n=14A318803
• Number of rooted trees with n nodes such that no more than nine isomorphic subtrees extend from the same node.at n=14A318856
• Number of simple non-isomorphic n-vertex graphs of connectivity 8.at n=11A324089
• If the binary expansion of A354780(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=44A354781