29295

Appears in sequences

• a(n) = Sum_{k=0..m} (k+1) * A026009(n, m-k) where m = floor(n/2)+1.at n=14A027292
• Number of permutations in the symmetric group S_n that have even order.at n=8A059838
• Product of sums of divisors and non-divisors.at n=31A066859
• Number of degree-n permutations with (mutually) relatively prime cycle lengths.at n=7A079128
• Binomial transform of (1,0,1,0,1,0,1,1,1,1,1,...).at n=15A084637
• a(n) is the number of permutations in the symmetric group S_n that contain an odd cycle.at n=8A087137
• a(n) = n! - ((n-1)!!)^2.at n=6A088979
• Odd infinitary abundant numbers.at n=18A127666
• a(n) = (2*n)! - ((2*n-1)!!)^2.at n=4A151816
• a(n) = n^3 - n*(n+1)/2.at n=31A160378
• Smallest k such that prime(k) + prime(k+1) = prime(k+2) + prime(k-n).at n=8A188268
• Number of zero-sum -6..6 arrays of n elements with first through third differences also in -6..6.at n=6A202509
• Number of zero-sum -n..n arrays of 7 elements with first through third differences also in -n..n.at n=5A202515
• Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))^2) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))^2 - y).at n=35A219963
• Third diagonal of Catalan difference table (A059346).at n=10A228338
• Decimal representation of the n-th iteration of the "Rule 57" elementary cellular automaton starting with a single ON (black) cell.at n=7A266674
• Products of three distinct tribonacci numbers > 1.at n=41A274434
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=20A293186
• Sum of the fifth largest parts in the partitions of n into 7 parts.at n=49A308929
• a(n) is the smallest number having exactly n ways to be represented as sum of at least two consecutive positive integers and expressible as sum of n consecutive positive integers, or 0 if no such number exists.at n=29A316744