A175719 a(1) = 1, for n >= 2, a(n) = the smallest number m with (a(n-1) + 3) divisors.
1, 6, 36, 36864
Offset: 1
Keywords
Examples
a(3) = 36 = the smallest number with 6 + 3 = 9 divisors.
Formula
A000005(a(n)) = a(n-1) + 3 for n >= 2.
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.