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”).
%I #31 Jul 19 2024 03:15:00
%S 1,3,5,7,9,13,15,19,21,27,35,37,39,45,57,63,65,73,91,95,105,109,111,
%T 117,133,135,171,185,189,195,219,247,259,273,285,315,327,333,351,365,
%U 399,455,481,511,513,545,555,585,657,665,703,741,763,777,819,855,945,949
%N Divisors of 2^36 - 1.
%C Number of divisors is 512.
%C 2^36 - 1 is the largest unsigned integer in a 36-bit word.
%H T. D. Noe, <a href="/A003543/b003543.txt">Table of n, a(n) for n = 1..512</a> (all divisors)
%H Paul Barry, <a href="https://arxiv.org/abs/2107.14278">Series reversion with Jacobi and Thron continued fractions</a>, arXiv:2107.14278 [math.NT], 2021.
%H <a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a>
%t Divisors[2^36-1] (* _Harvey P. Dale_, Jun 20 2015 *)
%o (PARI) {a(n)=local(x, d, N); if(n<1||n>512, 0, N=2^36-1; d=1; while(n>0, if(N%d==0, n--; x=d); d++); x)} /* _Michael Somos_, Feb 17 2006 */
%K nonn,fini,full,easy
%O 1,2
%A _N. J. A. Sloane_