24015

Appears in sequences

• Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y.at n=48A074483
• 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=28A110375
• a(n) = prime(n)*prime(n+1) + prime(n) + prime(n+1).at n=35A126199
• a(n) = 961*n^2 - 2*n.at n=4A158410
• Number of n X 2 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=32A241429
• Integers n where n^3 + (n+1)^3 is a Taxicab number A001235.at n=14A259836
• a(n) = 3*n*(64*n^2 + 1).at n=4A295130
• Antidiagonal sums of the array defined in A385623.at n=30A385624