25023

Appears in sequences

• From George Gilbert's marks problem: jumping 7 marks at a time (final positions).at n=14A019998
• a(n) = floor((1/2 * (sqrt(2) + 1 + sqrt(2*sqrt(2) - 1)))^n ).at n=16A050243
• a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).at n=25A062065
• Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n.at n=39A110375
• Number of 0..n arrays x(0..7) of 8 elements with zero 4th differences.at n=45A200331
• Number of (n+1)X(2+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise.at n=4A236517
• Number of (n+1)X(5+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise.at n=1A236520
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise.at n=16A236523
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise.at n=19A236523
• a(n) is the numerator of Sum_{d|n} sigma(n/d)^d/d, where sigma is A000203.at n=15A267310
• Smallest k such that the k-th tetrahedral number is divisible by exactly n tetrahedral numbers.at n=27A342808