31484

Appears in sequences

• Numbers k such that sigma(k+2) = sigma(k).at n=35A007373
• a(1) = 2; a(n+1) = a(n)-th composite.at n=42A022450
• Triangle read by rows: T(n,k) = n*T(n-1,k-1) + k*T(n-1,k) starting with T(0,0)=1.at n=33A078341
• Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=22A087414
• Array read by antidiagonals: number of ways of dividing an n X m rectangle into integer-sided rectangles.at n=23A116694
• Array read by antidiagonals: number of ways of dividing an n X m rectangle into integer-sided rectangles.at n=25A116694
• Number of ways of dividing a 3 X n rectangle into rectangles of integer side lengths.at n=5A208215
• Number of ways to cut a 5 X n rectangle into rectangles with integer sides.at n=3A220298
• 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 441", based on the 5-celled von Neumann neighborhood.at n=15A282225
• Multiples of 1852.at n=17A303272
• Triangle read by rows: T(n,k) gives the number of ways to partition an n X k grid into rectangles of integer side lengths with 0 <= k <= n.at n=18A333476