login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175719 a(1) = 1, for n >= 2, a(n) = the smallest number m with (a(n-1) + 3) divisors. 2

%I

%S 1,6,36,36864

%N a(1) = 1, for n >= 2, a(n) = the smallest number m with (a(n-1) + 3) divisors.

%F A000005(a(n)) = a(n-1) + 3 for n >= 2.

%e a(3) = 36 = the smallest number with 6 + 3 = 9 divisors.

%Y Cf. A014221, A175718, A175720.

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Aug 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 13:54 EDT 2021. Contains 346334 sequences. (Running on oeis4.)