34489

Appears in sequences

• Number of triangular n X n X n arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than 3.at n=3A217505
• T(n,k) is the number of triangular n X n X n arrays of occupancy after each element either stays or moves to some neighbor and with no occupancy greater than k.at n=18A217510
• T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array.at n=37A219002
• Unmatched value maps: number of 2 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 2 X n array.at n=7A219003
• Total number of parts in all partitions of n with at least one distinct part.at n=27A220477
• On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=44A352730
• E.g.f. A(x) satisfies A(x) = exp( 1/(1 - x/A(x)) - 1 ).at n=8A361095