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”).

A164530
a(1)=1. a(n) = the smallest multiple of d(n) that is > a(n-1), where d(n) = the number of positive divisors of n.
2
1, 2, 4, 6, 8, 12, 14, 16, 18, 20, 22, 24, 26, 28, 32, 35, 36, 42, 44, 48, 52, 56, 58, 64, 66, 68, 72, 78, 80, 88, 90, 96, 100, 104, 108, 117, 118, 120, 124, 128, 130, 136, 138, 144, 150, 152, 154, 160, 162, 168, 172, 174, 176, 184, 188, 192, 196, 200, 202, 204, 206
OFFSET
1,2
LINKS
MATHEMATICA
Block[{n = 1, d}, NestList[(d = DivisorSigma[0, ++n]) * Floor[# / d + 1] &, 1, 100]] (* Paolo Xausa, Mar 21 2024 *)
PROG
(PARI)
A164530_list(nmax)={my(A=vector(nmax)); A[1]=1;
for(k=2, nmax, my(i=1); while(numdiv(k)*i<A[k-1]+1, i+=1); A[k]=numdiv(k)*i); A}
A164530_list(100) \\ John Tyler Rascoe, Mar 20 2024
CROSSREFS
Sequence in context: A350355 A172311 A103829 * A058817 A328593 A254748
KEYWORD
nonn,easy
AUTHOR
Leroy Quet, Aug 15 2009
EXTENSIONS
Extended by Ray Chandler, Mar 15 2010
STATUS
approved