32520
domain: N
Appears in sequences
- Numbers n such that |Fibonacci(n) - prime(n)| is prime.at n=16A099381
- Sequence is {a(0,n)}, where a(m,0)=1, a(m,n) = a(m-1,n)+a(m,n-1) and a(0,n+1) is such that a(n+1,n+1) = a(0,n).at n=11A111518
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an odd level (0<=k<=floor(n/2)-1 for n>=2; k=0 for n=0,1).at n=27A114463
- Number of Dyck paths of semilength n having no ascents of length 2 that start at an odd level.at n=11A114465
- Numbers n with property that n+41, n^2+41 and n^3+41 are all primes.at n=18A175260
- Array read by antidiagonals: T(n,k) is the number of n-step king's tours on a k X k board summed over all starting positions.at n=49A186861
- Number of 5-step king's tours on an n X n board summed over all starting positions.at n=5A186864
- Number of aperiodic compositions of n with relatively prime parts. Number of compositions of n with relatively prime parts and relatively prime run-lengths.at n=15A296302
- The number of permutations of {1,1,1,1,2,2,2,2,...,n,n,n,n} such that each quadruple of k's (k=1..n) is equally spaced with b(k) other elements in between, and b(1) >= b(2) >= ... >= b(n).at n=7A332752
- Square array T(n,k), n >= 0, k >= 2, read by antidiagonals, where T(n,k) is the number of permutations of {k 1's, k 2's, ..., k n's} with the property that j's are equally spaced for j=1..n and the interval of j+1 is less than or equal to the interval of j for j=1..n-1.at n=52A332762
- Lexicographically earliest sequence of distinct terms > 1 such that no term is a substring of the product of any two terms.at n=33A381242