23918

Appears in sequences

• a(1) = 1; for n >= 1, replace each part, with repetitions, of every part k in each partition of n with a(k), then take the sum to get a(n+1).at n=12A096770
• Numbers k such that 2*F(k) + 1 is a prime, where F = A000045.at n=49A124067
• Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and equal numbers of elements moved upwards and downwards.at n=13A263738