30370

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, -1), (1, 0, 0), (1, 0, 1)}.at n=8A150371
• Numbers k such that k^2 + 1 = p*q, p and q primes and |p-q| is square.at n=38A187401
• Number of 0..n arrays x(0..10) of 11 elements with zero 6th differences.at n=34A200447
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 489", based on the 5-celled von Neumann neighborhood.at n=34A272512
• Number of n X 3 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=6A278275
• T(n,k) = Number of n X k 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=42A278280
• Number of 7Xn 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=2A278286
• Length of shortest prefix of the Kolakoski sequence K (A000002) containing all blocks of length n that appear in K.at n=46A283511