login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036436 Numbers whose number of divisors is a square. 6

%I #26 Jun 20 2021 02:31:21

%S 1,6,8,10,14,15,21,22,26,27,33,34,35,36,38,39,46,51,55,57,58,62,65,69,

%T 74,77,82,85,86,87,91,93,94,95,100,106,111,115,118,119,120,122,123,

%U 125,129,133,134,141,142,143,145,146,155,158,159,161,166,168,177,178,183

%N Numbers whose number of divisors is a square.

%C Invented by the HR (named after Hardy and Ramanujan) concept formation program.

%C Numbers in this sequence but not in A036455 are 1, 1260, 1440, 1800, 1980 etc. [From _R. J. Mathar_, Oct 20 2008]

%C tau(p^(n^2-1)) = n^2 so numbers of this form are in this sequence, and because tau is multiplicative: if a and b are in this sequence and (a,b)=1 then a*b is also in a(n). - _Enrique PĂ©rez Herrero_, Jan 22 2013

%D S. Colton, Automated Theorem Discovery: A Future Direction for Theorem Provers, 2002.

%H Amiram Eldar, <a href="/A036436/b036436.txt">Table of n, a(n) for n = 1..10000</a>

%H S. Colton, <a href="http://www.cs.uwaterloo.ca/journals/JIS/colton/joisol.html">Refactorable Numbers - A Machine Invention</a>, J. Integer Sequences, Vol. 2, 1999, #2.

%H S. Colton, <a href="http://www.dai.ed.ac.uk/homes/simonco/research/hr/">HR - Automatic Theory Formation in Pure Mathematics</a> (Unfortunately [403 Forbidden])

%H S. Colton and A. Bundy, <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8426">Automatic Concept Formation in Pure Mathematics</a>

%H S. Colton, A. Bundy and T. Walsh, <a href="http://www.doc.ic.ac.uk/~sgc/papers/colton_aisb00.pdf">Agent Based Cooperative Theory Formation in Pure Mathematics</a>

%H S. Colton, R. McCasland and A. Bundy, <a href="http://www.doc.ic.ac.uk/~sgc/html_papers/colton_radm02.html">Automated Theory Formation for Tutoring Tasks in Pure Mathematics</a>, 2002.

%e tau(6)=4, which is a square number, so 6 is in this sequence.

%t Select[Range[200],IntegerQ[Sqrt[DivisorSigma[0,#]]]&] (* _Harvey P. Dale_, Apr 20 2011 *)

%o (PARI) is(n)=issquare(numdiv(n)) \\ _Charles R Greathouse IV_, Jan 22 2013

%Y Cf. A009087, A033950, A057265, A049439.

%K easy,nonn

%O 1,2

%A Simon Colton (simonco(AT)cs.york.ac.uk)

%E Links corrected and edited by _Daniel Forgues_, Jun 30 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)