51541

Appears in sequences

• Sieve performed by successive iterations of steps where step m is: keep m terms, remove the next 3 and repeat; as m = 1,2,3,.. the remaining terms form this sequence.at n=24A112561
• Number of partitions of the set of odd numbers {1, 3, ..., 2*n-1} into two subsets such that the absolute difference of the sums of the two subsets is minimized.at n=22A290889
• Maximal coefficient of (1 + x) * (1 + x^3) * (1 + x^5) * ... * (1 + x^(2*n-1)).at n=23A350504
• Number of solutions to +- 1 +- 3 +- 5 +- 7 +- ... +- (2*n-1) = 0 or 1.at n=23A367087
• Number of solutions to +- 1 +- 3 +- 5 +- 7 +- ... +- (4*n-3) = 1.at n=12A369729