30902

Appears in sequences

• From George Gilbert's marks problem: jumping 3 marks at a time (initial positions).at n=21A019592
• Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=43A117455
• Number of nondecreasing integer sequences of length 24 with sum zero and sum of absolute values 2n.at n=14A158158
• Number of (n+2) X 4 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=21A190026
• Number of steps to reach 0 when starting from 2^n and iterating the map x -> x - (number of 1's in binary representation of x): a(n) = A071542(2^n) = A218600(n)+1.at n=18A213710
• Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.at n=58A308437
• Triangular array read by rows: T(n,k) is the number of labeled posets on [n] that are composed of exactly k irreducible posets, n >= 0, 0 <= k <= n.at n=23A354615
• a(n) is the least positive integer that can be expressed as the sum of two distinct nonzero decimal palindromes in exactly n ways.at n=41A364836