64752
domain: N
Appears in sequences
- Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=32A087414
- Expansion of x^9/((1-x)*(1-x^2)*(1-x^3))^2.at n=43A117485
- Sum of the first k-1 numbers in the k-th column of the natural number array A000027, by antidiagonals.at n=38A185788
- Number of 0..n arrays x(0..4) of 5 elements without any interior element greater than both neighbors or less than both neighbors.at n=14A200873
- Number of n X 3 0..6 arrays with no element equal to another at a city block distance of exactly two, and new values 0..6 introduced in row major order.at n=3A222778
- T(n,k)=Number of nXk 0..6 arrays with no element equal to another at a city block distance of exactly two, and new values 0..6 introduced in row major order.at n=17A222779
- T(n,k)=Number of nXk 0..6 arrays with no element equal to another at a city block distance of exactly two, and new values 0..6 introduced in row major order.at n=18A222779
- E.g.f.: 1 / (1 - x * exp(2*x)).at n=6A336950
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} (k * (n-j))^j/j!.at n=42A351790