23096

Appears in sequences

• Values that show the slow decrease in the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.at n=29A084977
• a(n) = 64*n^2 - 8.at n=18A158487
• Number of binary strings of length n with equal numbers of 00100 and 01001 substrings.at n=15A164236
• Number of (n+2)X(n+2) 0..1 arrays with nondecreasing medians of every three consecutive values in every row and column.at n=1A250496
• Number of (n+2)X(2+2) 0..1 arrays with nondecreasing medians of every three consecutive values in every row and column.at n=1A250498
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with nondecreasing medians of every three consecutive values in every row and column.at n=4A250504
• Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock diagonal median minus antidiagonal median nondecreasing horizontally and vertically.at n=1A253756
• Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal median minus antidiagonal median nondecreasing horizontally and vertically.at n=1A253758
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median minus antidiagonal median nondecreasing horizontally and vertically.at n=4A253764
• T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 6.at n=23A264728
• Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 6.at n=4A264730
• Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A300798
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A300800
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=24A300804
• Number of crossing, non-capturing set partitions of {1..n}.at n=11A326245
• Expansion of g.f. A(x) satisfying Sum_{n>=0} (-1)^n * x^n * Product_{k=0..n} (x^k + A(x)) = theta_2(x^(1/2)) / x^(1/8).at n=9A369682