37237

Appears in sequences

• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=40A125182
• Number of base 31 circular n-digit numbers with adjacent digits differing by 6 or less.at n=4A125419
• a(n) = least k such that the remainder when 31^k is divided by k is n.at n=17A128371
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, -1, 0), (1, 0, 1), (1, 1, 1)}.at n=8A150717
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=8A150718
• Smallest k such that (10^n+k, 10^n+k+2) and (10^(n+1)+k, 10^(n+1)+k+2) are two pairs of twin primes with k(n+1) > k(n).at n=7A224846
• Smallest k such that (10^n+k, 10^n+k+2) and (10^(n+1)+k, 10^(n+1)+k+2) are two pairs of twin primes.at n=7A224905
• a(n) = (n + 1)*(6*n^2 + 15*n + 4)/2.at n=22A269232