840456

Appears in sequences

• a(n) = n^2*(n^2 + 1)/2.at n=36A037270
• Number of reversible strings with n beads using a maximum of six different colors.at n=8A056308
• a(n) = (n^8 + n^4)/2.at n=6A071231
• Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers.at n=35A094260
• 5 X 5 X 5 triangular graph coloring a rectangular array: number of n X 2 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=4A223338
• 5X5X5 triangular graph coloring a rectangular array: number of nX5 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=1A223341
• T(n,k)=5X5X5 triangular graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=16A223344
• T(n,k)=5X5X5 triangular graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=19A223344
• Number of 3 X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally or antidiagonally.at n=7A233156
• If x is in the sequence then so are x^2 and x(x+1)/2.at n=40A241241
• Square array read by antidiagonals upwards: T(i,j) is the smallest number m such that the symmetric representation of sigma, SRS(m), has maximum width 3, consists of i parts and has 2*j occurrences of maximum width 3 in its width pattern (row m of A341969).at n=8A377667