cp's OEIS Frontend

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.

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.

Original entry on oeis.org

1, 2, 20, 20, 714, 714, 25550, 90180, 142803, 809300, 27195648, 27195648, 6973441007, 37962822225, 37962822225, 114296059262, 265228019405583, 394047434860662, 2493689139940250
Offset: 1

Views

Author

Amarnath Murthy, Sep 02 2002

Keywords

Comments

tau(k) >= tau(k+1) >= ... >= tau(k+n-1).
Next term is > 2000000. - David Wasserman, May 06 2005
a(17) > 10^12. [Donovan Johnson, Oct 13 2009]
a(20) > 2.64x10^15. - Jud McCranie, Mar 27 2019

Examples

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

Crossrefs

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
a(11)-a(16) from Donovan Johnson, Oct 13 2009
a(17)-a(19) from Jud McCranie, Mar 27 2019