28415

Appears in sequences

• Increasing gaps in A038593 (upper terms).at n=15A093362
• Minimum number of moves to solve a variant of the first Panex puzzle of order n of transferring a side tower to the center column.at n=11A115185
• Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 3,1 3,2 4,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155304
• Numbers n such that A193101(n) = 5.at n=20A193105
• Number of nonnegative integer arrays of length n+2*4-2 with new values introduced in order 0 upwards and every value appearing only in runs of at least 4.at n=22A211696
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..7 array extended with zeros and convolved with -1,2,-1.at n=18A222042
• Lengths of complete iterations (direct and reverse branches) of the Kolakoski sequence A000002.at n=41A249508
• Numbers n such that H(n)/H(n^2) is a new record, where H(n) = A000120(n) is the sum of the binary digits of n.at n=7A260986
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 118", based on the 5-celled von Neumann neighborhood.at n=15A278954
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=15A282076
• Trajectory of n under the Reverse and Add! operation carried out in base 8 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=34A306596
• Number of nXn 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=15A317766
• a(n) = (A230624(n)-2)/4.at n=53A350607
• a(n) is the least number k such that (the binary weight of k) - (the binary weight of k^2) = n.at n=7A356877