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.

A075028 a(1) = 1, then a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in strictly ascending order.

Original entry on oeis.org

1, 1, 61, 61, 11371, 11371, 7392171, 168776043, 1584614377, 38045133481, 30386250649371, 1848289766450821
Offset: 1

Views

Author

Amarnath Murthy, Sep 02 2002

Keywords

Comments

tau(k) < tau(k+1) < ... < tau(k+n-1).
a(11) > 10^12. - Donovan Johnson, Oct 13 2009
a(11) > 10^13. - Giovanni Resta, Jul 25 2013
a(13) > 2.64*10^15. - Jud McCranie, Mar 27 2019

Examples

			a(3) = 61 = a(4) as tau(61) = 2 < tau(62) = 4 < tau(63) = 6 < tau(64) = 7.
		

Crossrefs

Extensions

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