login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318938 If n=0 then 1 otherwise 16*(1+22*A318935(n))*(sum of cubes of odd divisors of n). 1

%I

%S 1,368,3184,10304,25712,46368,89152,126592,205936,278576,401184,

%T 490176,719936,808864,1095296,1298304,1647728,1808352,2410288,2524480,

%U 3239712,3544576,4241088,4477824,5766208,5796368,6998432,7521920,8844928,8975520,11233152,10963456,13182064,13724928,15646176,15950592,19463984

%N If n=0 then 1 otherwise 16*(1+22*A318935(n))*(sum of cubes of odd divisors of n).

%H P. J. C. Lamont, <a href="https://doi.org/10.1017/S001309150000420X">The number of Cayley integers of given norm</a>, Proceedings of the Edinburgh Mathematical Society, 25.1 (1982): 101-103. See (7).

%p with(numtheory);

%p A007814 := n -> padic[ordp](n, 2):

%p T:= n -> add(2^(3*m),m=0..A007814(n));

%p f := proc(n) local t2,i,d;

%p if n=0 then return(1); fi;

%p t2:=0; for d in divisors(n) do if (d mod 2) = 1 then t2:=t2+d^3; fi; od:

%p 16*(1+22*T(n))*t2;

%p end;

%p [seq(f(k),k=0..50)];

%Y Cf. A318935.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Sep 15 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 20:36 EDT 2021. Contains 348047 sequences. (Running on oeis4.)