27313

Appears in sequences

• Numerators of continued fraction convergents to sqrt(746).at n=8A042436
• a(n) is the number of unlabeled forests of rooted trees with n nodes such that no two trees are identical.at n=13A052827
• Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives x of each pair.at n=37A070152
• Numbers k such that k + sigma(k) + phi(k) is a square.at n=35A116009
• Array read by antidiagonals: see A128195 for details.at n=32A126062
• Minimum value unattainable as the sum of 2 attained values of a*b*c with a,b,c 0..n integers.at n=28A225264
• Number of defective 3-colorings of an n X 3 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.at n=5A229454
• Number of defective 3-colorings of an nX6 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.at n=2A229457
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.at n=30A229460
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.at n=33A229460
• Number of length n+5 0..2 arrays with some disjoint triples in each consecutive six terms having the same sum.at n=10A248062
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 405", based on the 5-celled von Neumann neighborhood.at n=33A271814
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+27298) 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=19A283888
• a(n) is the end square spiral number for a knight starting on square n moving on a board with squares numbered with the square of their distance from the 0-square origin and where the knight moves to the smallest numbered unvisited square; the smallest spiral number ordering is used if the distances are equal.at n=29A326931
• Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.at n=41A363740