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!)
A062835 a(1) = 0; for n > 1 a(n) = sum of divisors of n^2-1; or sigma(A005563(n-1)). 4

%I #29 Sep 08 2022 08:45:03

%S 0,4,15,24,60,48,124,104,186,156,360,168,480,336,504,432,819,360,1170,

%T 640,1080,768,1488,744,1736,1240,1680,1200,2880,960,3048,1536,2286,

%U 2304,3510,1824,3900,2128,3720,2352,5952,1848,5760,3432,4320,3744,6048

%N a(1) = 0; for n > 1 a(n) = sum of divisors of n^2-1; or sigma(A005563(n-1)).

%H Metin Sariyar, <a href="/A062835/b062835.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)

%p with(numtheory): seq( `if`(n=1, 0, sigma(n^2 -1)), n=1..100); # _G. C. Greubel_, Dec 31 2019

%t Table[If[n==1,0,DivisorSigma[1, n^2 - 1]], {n, 120}] (* corrected by _Metin Sariyar_, Dec 12 2019 *)

%o (PARI) a(n)={if(n<2, 0, sigma(n^2 - 1))}

%o (Magma) [0] cat [DivisorSigma(1, n^2 -1): n in [2..100]]; // _G. C. Greubel_, Dec 31 2019

%o (Sage) [0]+[sigma(n^2 -1, 1) for n in (2..100)] # _G. C. Greubel_, Dec 31 2019

%o (GAP) Concatenation([0], List([2..100], n-> Sigma(n^2 -1) )); # _G. C. Greubel_, Dec 31 2019

%Y Cf. A000203, A005563.

%K easy,nonn

%O 1,2

%A _Jason Earls_, Jul 21 2001

%E Name corrected by _Omar E. Pol_, Dec 08 2019

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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)