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!)
A075031 a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are nonincreasing. 5

%I #16 Mar 27 2019 18:40:39

%S 1,2,20,20,714,714,25550,90180,142803,809300,27195648,27195648,

%T 6973441007,37962822225,37962822225,114296059262,265228019405583,

%U 394047434860662,2493689139940250

%N a(n) is the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are nonincreasing.

%C tau(k) >= tau(k+1) >= ... >= tau(k+n-1).

%C Next term is > 2000000. - _David Wasserman_, May 06 2005

%C a(17) > 10^12. [_Donovan Johnson_, Oct 13 2009]

%C a(20) > 2.64x10^15. - _Jud McCranie_, Mar 27 2019

%e a(3)=a(4) = 20 as tau(20) > tau(21) = tau(22) > tau(23).

%Y Cf. A075028, A075029, A075046.

%K nonn,more

%O 1,2

%A _Amarnath Murthy_, Sep 02 2002

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003

%E a(11)-a(16) from _Donovan Johnson_, Oct 13 2009

%E a(17)-a(19) from _Jud McCranie_, Mar 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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)