159744

Appears in sequences

• a(n) = n*(n+1)*2^(n-2).at n=12A001788
• Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).at n=25A058582
• 14-almost primes (generalization of semiprimes).at n=21A069275
• Least number m such that cardinality of InvPhi(m) = prime(n).at n=31A071389
• a(n) = -a(n-1) - a(n-2) + a(n-3) - a(n-5).at n=35A089134
• Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.at n=40A143897
• 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, 0), (0, 0, -1), (1, -1, 1), (1, 1, 0)}.at n=10A149269
• Expansion of (1-x+4*x^2)/(1-2*x)^2.at n=13A167667
• (n-1)-st elementary symmetric function of the first n terms of (1,2,1,2,1,2,1,2,1,2,...)=A000034.at n=25A203150
• Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k).at n=32A217298
• Number of height maximal AVL trees with n (leaf-) nodes.at n=23A217300
• a(n) = sigma(2*n^3) - sigma(n^3).at n=39A225959
• Expansion of (phi(x) / f(-x^4))^4 in powers of x where phi(), f() are Ramanujan theta functions.at n=30A227175
• Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=6A268898
• T(n,k)=Number of nXk 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=34A268904
• Number of 7Xn 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.at n=1A268910
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=19A285539
• Number of 4-cycles in the n-Sierpinski tetrahedron graph.at n=7A292542
• Triangle read by rows: T(0,0) = 1; T(n,k) = -2 T(n-1,k) + 3 * T(n-3,k-1) for k = 0..floor(n/3); T(n,k)=0 for n or k < 0.at n=46A317503
• Triangle read by rows: T(0,0) = 1; T(n,k) = 2*T(n-1,k) + T(n-5,k-1) for k = 0..floor(n/5); T(n,k)=0 for n or k < 0.at n=57A318776