28486

Appears in sequences

• Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).at n=12A033861
• Number of walks of length n on the square lattice that start from (0,0) and do not touch the half-line {x=y, x <= 0} once they have left their starting point.at n=8A053792
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=10A148609
• Number of (n+1)X(5+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=0A231417
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=10A231419
• Number of (1+1) X (n+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=4A231420
• Number of simple involutions of length n.at n=13A244522
• Composite numbers k such that phi(x) = psi(k)*phi(k) has no solution.at n=27A292714
• a(n) is the number of regions formed by n-secting the angles of a nonagon (enneagon).at n=40A335781