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!)
A101742 a(n+1) = smallest number greater than a(n) having either more divisors than a(n) or exactly as many divisors as a(n-1). 1

%I #3 Mar 30 2012 18:50:48

%S 1,2,4,5,6,7,8,11,12,13,14,16,18,24,28,30,32,36,44,48,50,54,60,66,72,

%T 78,80,84,112,120,162,168,176,180,208,210,240,264,288,312,336,360,432,

%U 480,528,540,560,576,600,720,756,840,864,900,924,960,990,1008,1020,1080

%N a(n+1) = smallest number greater than a(n) having either more divisors than a(n) or exactly as many divisors as a(n-1).

%C A101743(n) = A000005(a(n));

%C a(n+1)>a(n) and (A101743(n+1)>A101743(n) or A101743(n+1)=A101743(n-1)).

%Y Cf. A000005, A007416.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Dec 16 2004

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)