127464

Appears in sequences

• a(n) = ceiling(n^n/n!).at n=14A073225
• 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, -1, 0), (-1, 1, -1), (0, 1, -1), (1, 0, 1)}.at n=11A148651
• Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^(n + 1)*Sum[(k + 1)*(1 + k + k^2)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^(n + 1)*Sum[(1 + k + k^2)^Floor[n/2]*x^ k, {k, 0, Infinity}]].at n=46A169625
• 4 X 4 square grid graph coloring a rectangular array: number of n X 2 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=4A223396
• 4 X 4 square grid graph coloring a rectangular array: number of n X 5 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223399
• T(n,k)=4X4 square grid graph coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=16A223402
• T(n,k)=4X4 square grid graph coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=19A223402