25056

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 79.at n=36A031577
• Theta series of lattice D3 tensor D3* (dimension 9, det. 262144, min. norm 6).at n=26A033694
• Numbers n such that phi(4n+1) = sigma(n).at n=8A067234
• a(n) = sigma_3(n) - sigma_1(n).at n=27A092348
• Square spiral of sums of selected preceding terms, starting at 1 (a spiral Fibonacci-like sequence).at n=19A094767
• 4 X 4 analog of A094943.at n=4A109467
• Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,4).at n=15A126958
• 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, -1, 1), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150239
• Triangle T(n,k) = (2*n-k-1)*T(n-1,k-1) + (k+1)*T(n-1,k), with T(n,1) = T(n,n) = 1, 1 <= k <= n, read by rows.at n=25A156139
• Least number m, written in base 10, such that m/3 is obtained merely by shifting the leftmost digit of m to the right end, and 3m by shifting the rightmost digit of m to the left end, digits defined in base n.at n=13A160116
• Numbers with prime factorization pq^3r^5.at n=11A190011
• Least number m such that phi(m-6n) = phi(m) = phi(m+6n) and m is not divisible by n.at n=3A217068
• Number of nX7 -1,1 arrays such that the sum over i=1..n,j=1..7 of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute 7-across galley oarsmen left-right at n fore-aft positions so that there are no turning moments on the ship).at n=7A225343
• Number of 8Xn -1,1 arrays such that the sum over i=1..8,j=1..n of i*x(i,j) is zero, the sum of x(i,j) is zero, and rows are nondecreasing (number of ways to distribute n-across galley oarsmen left-right at 8 fore-aft positions so that there are no turning moments on the ship).at n=6A225348
• Number of length 3+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=10A252179
• Number of (n+2) X (1+2) 0..1 arrays with no 3 x 3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum.at n=4A258538
• Number of (n+2)X(5+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum.at n=0A258542
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum.at n=10A258545
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum less than the antidiagonal sum or central row sum equal to the central column sum.at n=14A258545
• Numbers n such that antisigma(n) divides Fibonacci(n).at n=6A286125