23507

Appears in sequences

• Gaps of 10 in sequence A038593 (upper terms).at n=14A038660
• a(n) is largest semiprime < 2*a(n-1), with a(1) = 4.at n=14A217836
• Number of n X 2 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 3 0..2 array without adjacent equal elements in the latter.at n=6A229515
• Number of n X 7 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 8 0..2 array without adjacent equal elements in the latter.at n=1A229520
• T(n,k) = number of n X k 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X (k+1) 0..2 array without adjacent equal elements in the latter.at n=29A229521
• T(n,k) = number of n X k 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X (k+1) 0..2 array without adjacent equal elements in the latter.at n=34A229521
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 237", based on the 5-celled von Neumann neighborhood.at n=31A270982
• T(n,k) is the number permutations p of [n] that are k-dist-increasing but not j-dist-increasing for any j<k, where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=59A370507