71310

Appears in sequences

• Smallest number which requires n^2 steps in the 3x+1 problem.at n=18A066773
• G.f.: [Sum_{n>=0} x^(n*(n+1)/2) * (1+x)^n ]^3.at n=46A182152
• Number of nX4 arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=4A221727
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two.at n=32A221728