31605

Appears in sequences

• Related to Gilbreath conjecture.at n=33A001549
• (n^4 - 10*n^2 + 15*n - 6)/2.at n=15A135916
• Binomial transform of A120070.at n=11A141595
• 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, 1), (-1, 0, 1), (0, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=8A150282
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+511)^2 = y^2.at n=24A207078
• a(n) = n^2*(n+1)*(3*n+1)/4.at n=14A213827
• Number of nX2 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake.at n=5A278621
• Number of nX6 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake.at n=1A278625
• T(n,k)=Number of nXk 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake.at n=22A278627
• T(n,k)=Number of nXk 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake.at n=26A278627
• a(n) = Sum_{k=1..n} sigma_2( n/gcd(k,n) ).at n=34A372226