19452

Appears in sequences

• a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=44A005186
• a(n) = A027113(n, n+3).at n=11A027116
• a(n) = (9*n^4 + 4*n^3 - n)/2.at n=8A047786
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| = 2*|x-y| - |y-z|.at n=36A212578
• Expansion of Product_{k>=1} (1 + x^(k^2))^2/(1 - x^(k^2))^2.at n=31A279227
• Array read by antidiagonals: T(m,n) = number of irredundant sets in the lattice (rook) graph K_m X K_n.at n=47A290818
• Array read by antidiagonals: T(m,n) = number of irredundant sets in the lattice (rook) graph K_m X K_n.at n=52A290818
• Number of integer partitions of n such that either the run-lengths or the negated run-lengths are unimodal.at n=38A332746
• Number of free Tangles of size n.at n=9A333233