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.

A053640 Number of divisors of highly composite odd numbers (A053624).

This page as a plain text file.
%I A053640 #22 Mar 31 2023 14:57:48
%S A053640 1,2,3,4,6,8,9,12,16,18,20,24,32,36,40,48,54,64,72,80,96,108,120,128,
%T A053640 144,160,192,216,240,256,288,320,384,432,480,512,576,640,720,768,864,
%U A053640 960,1024,1152,1280,1440,1536,1728,1920,2048,2304,2560,2880,3072,3456
%N A053640 Number of divisors of highly composite odd numbers (A053624).
%C A053640 a(n) is the number of divisors of the odd parts of A340506(n); see also comments in A250071. - _Hartmut F. W. Hoft_, Mar 29 2022
%H A053640 Amiram Eldar, <a href="/A053640/b053640.txt">Table of n, a(n) for n = 1..363</a> (terms 1..170 from Ray Chandler)
%F A053640 a(n) = A000005(A053624(n)).
%e A053640 a(15) = 6 since A053624(6) = 45 has the 6 divisors 1, 3, 5, 9, 15, 45. - _Hartmut F. W. Hoft_, Mar 29 2022
%t A053640 a053640[n_] := Module[{recL={1}, q, d}, For[q=1, q<=n, q+=2, d=Length[Divisors[q]]; If[Last[recL]<d, AppendTo[recL ,d]]];recL]
%t A053640 a053640[150000000] (* _Hartmut F. W. Hoft_, Mar 29 2022 *)
%Y A053640 Cf. A000005, A053624.
%Y A053640 Cf. A237593, A237048, A237270, A250071, A340506.
%K A053640 nonn
%O A053640 1,2
%A A053640 Stefano Lanfranco (lastefano(AT)yahoo.it), Mar 22 2000
%E A053640 Extended by _Ray Chandler_, Jan 12 2012