20836

Appears in sequences

• Sum of the areas of the Durfee squares of all partitions of n.at n=25A116503
• 3 X 3 X 3 triangular graph without horizontal edges coloring a rectangular array: number of n X 3 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=3A223347
• 3 X 3 X 3 triangular graph without horizontal edges coloring a rectangular array: number of n X 4 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=2A223348
• T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=17A223352
• T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=18A223352
• Numbers m such that the decimal number concat(8,m) is a square.at n=28A273363
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 777", based on the 5-celled von Neumann neighborhood.at n=28A273532
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+20830) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=7A283887
• Number of multisets of exactly two partitions of positive integers into distinct parts with total sum of parts equal to n.at n=33A320787
• G.f.: Sum_{k>=1} (k^2 * x^(k^2) / Product_{j=1..k} (1 - x^j)).at n=50A333141
• a(n) = 3*binomial(n,4) - 6*binomial(n,3) + 4*binomial(n,2) - 2.at n=24A335694