trizen 06fe1bd46c new file: oeis-research/J. Lowell/a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1)/prog.pl 2 년 전
..
a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1) 06fe1bd46c new file: oeis-research/J. Lowell/a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1)/prog.pl 2 년 전
a(1)=2048. For n>1, a(n) is the LCM of a(n-1) and A140635(a(n-1)) 4b729ebdf6 new file: oeis-research/J. Lowell/a(1)=2048. For n>1, a(n) is the LCM of a(n-1) and A140635(a(n-1))/prog.pl 2 년 전