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

 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
 0, 4, 15, 24, 60, 48, 124, 104, 186, 156, 360, 168, 480, 336, 504, 432, 819, 360, 1170, 640, 1080, 768, 1488, 744, 1736, 1240, 1680, 1200, 2880, 960, 3048, 1536, 2286, 2304, 3510, 1824, 3900, 2128, 3720, 2352, 5952, 1848, 5760, 3432, 4320, 3744, 6048 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Metin Sariyar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harry J. Smith) MAPLE with(numtheory): seq( `if`(n=1, 0, sigma(n^2 -1)), n=1..100); # G. C. Greubel, Dec 31 2019 MATHEMATICA Table[If[n==1, 0, DivisorSigma[1, n^2 - 1]], {n, 120}] (* corrected by Metin Sariyar, Dec 12 2019 *) PROG (PARI) a(n)={if(n<2, 0, sigma(n^2 - 1))} (MAGMA) [0] cat [DivisorSigma(1, n^2 -1): n in [2..100]]; // G. C. Greubel, Dec 31 2019 (Sage) [0]+[sigma(n^2 -1, 1) for n in (2..100)] # G. C. Greubel, Dec 31 2019 (GAP) Concatenation([0], List([2..100], n-> Sigma(n^2 -1) )); # G. C. Greubel, Dec 31 2019 CROSSREFS Cf. A000203, A005563. Sequence in context: A192201 A054308 A051531 * A203231 A171788 A063129 Adjacent sequences:  A062832 A062833 A062834 * A062836 A062837 A062838 KEYWORD easy,nonn AUTHOR Jason Earls, Jul 21 2001 EXTENSIONS Name corrected by Omar E. Pol, Dec 08 2019 STATUS approved

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.

Last modified August 13 08:18 EDT 2022. Contains 356079 sequences. (Running on oeis4.)