56496

Appears in sequences

• a(n) = (n/2)*(n + 1)*(3*n + 11).at n=31A059997
• Number of nX3 arrays containing 3 copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1.at n=3A265868
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1.at n=18A265870
• Number of 4Xn arrays containing n copies of 0..4-1 with no element plus any antidiagonal neighbor equal to 4-1.at n=2A265872
• Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member.at n=46A290100