login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161767 a(0)=0, a(1)=2. For n >=2, a(n) = the smallest integer >= a(n-1)+2 with exactly (a(n-1)-a(n-2)) divisors. 1

%I #14 Jan 27 2019 14:08:51

%S 0,2,5,9,14,16,19,25,28,49,576,46221064723759104

%N a(0)=0, a(1)=2. For n >=2, a(n) = the smallest integer >= a(n-1)+2 with exactly (a(n-1)-a(n-2)) divisors.

%C a(n)-a(n-1) = number of divisors of a(n+1) = A161768(n).

%Y Cf. A000005, A161768.

%K nonn

%O 0,2

%A _Leroy Quet_, Jun 18 2009

%E a(11) from _Amiram Eldar_, Jan 27 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 08:14 EDT 2024. Contains 371769 sequences. (Running on oeis4.)