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!)
A144943 a(n) = number of divisors of n^3 (excluding 1 and n^3). 3

%I #9 May 19 2017 14:41:46

%S 0,2,2,5,2,14,2,8,5,14,2,26,2,14,14,11,2,26,2,26,14,14,2,38,5,14,8,26,

%T 2,62,2,14,14,14,14,47,2,14,14,38,2,62,2,26,26,14,2,50,5,26,14,26,2,

%U 38,14,38,14,14,2,110,2,14,26,17,14,62,2,26,14,62,2,68,2,14,26,26,14,62,2,50

%N a(n) = number of divisors of n^3 (excluding 1 and n^3).

%H Antti Karttunen, <a href="/A144943/b144943.txt">Table of n, a(n) for n = 1..1001</a>

%F For n > 1, a(n) = A048785(n) - 2. - _Antti Karttunen_, May 19 2017

%t Join[{0},(DivisorSigma[0,#]-2)&/@(Range[2,90]^3)] (* _Harvey P. Dale_, Apr 02 2011 *)

%o (PARI) A144943(n) = if(1==n,0,numdiv(n^3)-2); \\ _Antti Karttunen_, May 19 2017

%Y Cf. A000005, A048785.

%K nonn

%O 1,2

%A Mark Taggart (mt2612f(AT)aol.com), Sep 26 2008

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)