36952
domain: N
Appears in sequences
- Number of -5..5 arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=2A200427
- T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=23A200430
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two or three adjacent elements summing to zero.at n=4A200433
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x+y*z>=n^2.at n=25A212132
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood.at n=32A287981
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood.at n=33A287981
- Starting at n, a(n) is the number of times we travel to a position already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=63A324674