262192

Appears in sequences

• T(n,3), array T as in A054134.at n=13A054137
• a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors.at n=19A069654
• a(1)=1. a(n) = the smallest integer > a(n-1) such that |d(a(n)) - d(a(n-1))| = n-1, where d(m) = the number of positive divisors of m.at n=14A139695
• a(n) = 1 + sum{k=1 to n} A177268(k).at n=18A177269
• a(n) = n^6 + 6n.at n=8A180356
• a(n) = 8^n + 8*n.at n=6A221910
• a(n) = A255411(A265907(n)); also the first differences of A265907.at n=5A265908
• 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=22A275960
• Transpose of array A275960.at n=26A275961