87453

Appears in sequences

• Define G(x) = Sum_{n>=0} a(n)*x^n/2^[n*(n-1) - A000120(n)], then [x^n] G(x)^(1/2^n) = 1 for n>=0, where A000120(n) = number of 1's in binary expansion of n.at n=4A134096
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (1, -1, 1), (1, 1, 1)}.at n=9A149685
• Binomial transform of A166242.at n=14A166452
• Total number of parts that are not the smallest part in all partitions of n.at n=35A182984
• a(n) is the smallest odd k such that k + 2^m is a de Polignac number for m = 1..n.at n=3A355885