124672

Appears in sequences

• Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(2,5) + cn(3,5) and 0 < cn(0,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=47A039903
• The floor(n/3)-perfect numbers, where f-perfect numbers for an arithmetical function f are defined in A066218.at n=13A066238
• Number of partitions of n+5 with largest inscribed rectangle having area <= n.at n=42A218626
• Numbers k whose abundance is 24: sigma(k) - 2*k = 24.at n=2A223613
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 419", based on the 5-celled von Neumann neighborhood.at n=16A288063
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 478", based on the 5-celled von Neumann neighborhood.at n=16A288506
• a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square.at n=40A384208
• a(n) = (1/2) * Sum_{k=0..floor(n/2)} 2^(n-k) * binomial(2*k+2,2*n-4*k+1).at n=13A387553