31960

Appears in sequences

• Related to representation as sums of squares.at n=35A002292
• Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=45A035957
• Number of optimal binary prefix-free codes with n words all ending in 1.at n=46A055167
• Structured great rhombicosidodecahedral numbers.at n=9A100145
• Triangular array read by rows: for n, k >= 1, a(n+1, 1) = 2*a(n, n); a(n+1, k+1) = a(n, k)+a(n+1, k).at n=33A129340
• Integers n > 1 such that A130280(4n^2) < n, i.e., there is an m < n, m > 1 such that 4n^2(m^2 - 1) + 1 is a square.at n=22A130281
• a(n) = 8000*n - 40.at n=3A157660
• Numbers that take a record number of steps to appear in A181391.at n=49A171863
• Sum of the first k-1 numbers in the k-th column of the natural number array A000027, by antidiagonals.at n=30A185788
• Number of (w,x,y) with all terms in {0,...,n} and even range.at n=39A212975
• Number of (n+2) X (1+2) 0..1 arrays with no 3 x 3 subblock diagonal sum one and no antidiagonal sum one.at n=4A255075
• Number of (n+2)X(5+2) 0..1 arrays with no 3x3 subblock diagonal sum one and no antidiagonal sum one.at n=0A255079
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum one and no antidiagonal sum one.at n=10A255082
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum one and no antidiagonal sum one.at n=14A255082
• Number of compositions of n where the difference between largest and smallest parts equals two.at n=16A323119
• a(n) = Sum_{k=0..floor(3*n/8)} binomial(k+2,3*n-8*k).at n=45A390036
• a(n) = Sum_{k=0..floor(n/2)} binomial(k+3,4*n-8*k+3).at n=31A390040