login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A143178
a(1)=1. a(n) is the smallest positive multiple of n that has more, or the same number of, divisors than a(n-1) has.
3
1, 2, 3, 4, 10, 6, 14, 8, 18, 20, 44, 12, 52, 28, 30, 48, 204, 72, 228, 60, 84, 132, 276, 72, 150, 156, 108, 84, 348, 60, 372, 96, 132, 204, 140, 72, 444, 228, 156, 120, 984, 168, 1032, 264, 180, 828, 1692, 240, 1176, 600, 1020, 780, 3180, 540, 660, 504, 1140, 1740
OFFSET
1,2
LINKS
EXAMPLE
a(10) = 20, which has 6 divisors. Checking, for n = 11: 1*11=11 has 2 divisors. 2*11=22 has 4 divisors. 3*11=33 has 4 divisors. Each of these positive multiples of 11 has < 6 divisors. But 4*11=44 has 6 divisors. And since 6 >=6, then a(11) = 44.
MATHEMATICA
nxt[{n_, a_}]:=Module[{k=1}, While[DivisorSigma[0, a]>DivisorSigma[ 0, k(n+1)], k++]; {n+1, k(n+1)}]; Transpose[NestList[nxt, {1, 1}, 60]][[2]] (* Harvey P. Dale, Sep 22 2014 *)
CROSSREFS
Sequence in context: A111619 A241083 A334463 * A084190 A377484 A203070
KEYWORD
nonn
AUTHOR
Leroy Quet, Jul 28 2008
EXTENSIONS
a(13)-a(58) from Donovan Johnson, Sep 05 2008
STATUS
approved