31064

Appears in sequences

• Number of positive integers <= 2^n of form x^2 + y^2.at n=17A000050
• Numbers n with property that n^2 is a sum of some 120 successive primes.at n=15A166262
• Numbers of the form prime(n)*(prime(n)-1)/4.at n=33A171555
• Number of 4-step left-handed knight's tours (moves only out two, left one) on an n X n board summed over all starting positions.at n=32A187174
• Number of (w,x,y,z) with all terms in {1,...,n} and 2|w-x|>=n+|y-z|.at n=22A212688
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=5A234883
• Number of (n+1) X (6+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A234888
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=15A234890
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=20A234890
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that min(x(i) - x(i-1)) < number of distinct parts of p.at n=39A241823
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p.at n=40A241829
• Numbers k such that Bernoulli number B_{k} has denominator 61410.at n=16A295591
• a(n) = [x^n] Product_{k>=1} (1 + x^k)*(1 - x^(n*k))/((1 - x^k)*(1 + x^(n*k))).at n=25A304627