40026

Appears in sequences

• a(n) = number of partitions of primes into distinct (also odd) parts.at n=20A064688
• Number of ways to partition 2n+1 into distinct positive integers.at n=36A078408
• Number of ways to partition 4*n+1 into distinct positive integers.at n=18A078409
• a(n) is the least positive integer k such that g(k) = n*g(k-1), where g(k) = prime(k+1) - prime(k).at n=12A078563
• Multiples of 7 in which there is no common digit in successive terms.at n=26A083495
• Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 8).at n=15A250264
• Triangle T(n,k), n >= 2, 0 <= k <= floor(n^2/2)-2, read by rows, where T(n,k) is the number of 2*(k+2)-cycles in the n X n grid graph which pass through NW corner (0,0).at n=31A333651