48137

Appears in sequences

• 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, -1), (-1, -1, 0), (-1, 0, 0), (1, 0, -1), (1, 1, 1)}.at n=9A149543
• Number of Dyck paths with no UUU's and no DDD's, of semilength n and having no UDUD's (U=(1,1), D=(1,-1)).at n=22A166289
• Concatenation of n-th nonprime and n-th prime.at n=32A253911
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 515", based on the 5-celled von Neumann neighborhood.at n=7A272706
• Triangle read by rows: T(n,k) is the number of simple nonseparable (or 2-connected) graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).at n=33A325447