24598

Appears in sequences

• Coordination sequence for MgNi2, Position Ni1.at n=39A009933
• Riordan array (1/(1-3x),x(1-x)/(1-3x)^2).at n=40A114195
• Matrix square, T(n,k), of Parker's partition triangle A047812, read by rows (n >= 1 and 0 <= k <= n-1).at n=41A128567
• Numbers k such that Sum_{i=1..k} i^6 divides Product_{i=1..k} i^6.at n=24A166606
• Potential magic constants of a 10 X 10 magic square composed of consecutive primes.at n=31A192087
• a(n) = A255411(A265907(n)); also the first differences of A265907.at n=4A265908
• Square array A(1,k) = A265907(k), A(n>1,k) = A(n-1, k+1) - A(n-1, k); successive differences of A265907 read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=16A275960
• Transpose of array A275960.at n=19A275961
• Maximum starting value of X such that repeated replacement of X with X-ceiling(X/6) requires n steps to reach 0.at n=49A279076
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) - 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=18A293317
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -2, a(1) = 0, a(2) = 1, a(3) = 1.at n=19A295859
• Shortest distance from curve start to end along the segments of dragon curve expansion level n, and which is the diameter of the curve as a graph.at n=26A343949