19508

Appears in sequences

• Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=20A090167
• Triangle, read by rows, where the g.f. of row n divided by (1-x)^n yields the g.f. of column n in the triangle A122888, for n>=1.at n=42A122890
• Triangle, read by rows n>=1, where row n is the n-th differences of column n of array A158825, where the g.f. of row n of A158825 is the n-th iteration of x*Catalan(x).at n=38A158830
• Numbers k such that 3^k - 32 is prime.at n=16A219049
• G.f. satisfies: A(x) = (A(x^2) + x)^2.at n=34A224272
• Number of length n+6 0..1 arrays with at most one downstep in every 6 consecutive neighbor pairs.at n=12A255990
• Sum of squares of parts of the partitions of 2n into two squarefree parts.at n=26A280316
• Numbers k such that k + sopfr(k) is a cube.at n=22A389862