47976

Appears in sequences

• t(n^2) is a square and sets a new record for such squares, where t(n) = (sigma(n)-n)*omega(n); or t(n)= A001065(n)*A001221(n).at n=11A063777
• 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, 0, 0), (-1, 0, 1), (0, -1, 1), (0, 0, -1), (1, 1, 0)}.at n=9A149431
• a(n) = 1728*n - 408.at n=27A157266
• T(n,k)=Number of (n+1)X(k+1) binary arrays with each element of every 2X2 subblock being the sum mod 2 of two others.at n=36A183845
• 12 times the total number of smallest parts in all partitions of n, with a(0) = 0.at n=22A211609
• Number of nX3 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns.at n=3A221549
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns.at n=18A221551
• Number of 4Xn arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns.at n=2A221554
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 177", based on the 5-celled von Neumann neighborhood.at n=40A270620
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 291", based on the 5-celled von Neumann neighborhood.at n=41A271131
• Number of ways to write n as an ordered sum of 6 nonzero decimal palindromes.at n=24A341203