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!)
A335153 a(1)=0; thereafter a(n) = (n-1)*sigma(n)-n*sigma(n-1) where sigma is the sum-of-divisors function A000203. 1

%I #9 Dec 30 2021 17:32:05

%S 0,1,-1,5,-11,24,-36,41,-31,32,-78,164,-196,116,-24,81,-239,339,-381,

%T 398,-242,52,-300,804,-756,244,-94,392,-784,1188,-1272,929,-543,150,

%U -258,1457,-1999,776,-212,1270,-2010,2172,-2280,1676,-348,-348,-1176,3524,-3340,1707,-1143,1254,-2386,3444,-2712,2568,-2360,490

%N a(1)=0; thereafter a(n) = (n-1)*sigma(n)-n*sigma(n-1) where sigma is the sum-of-divisors function A000203.

%H N. J. A. Sloane, <a href="/A335153/b335153.txt">Table of n, a(n) for n = 1..10000</a>

%t Join[{0},Table[(n-1)DivisorSigma[1,n]-n DivisorSigma[1,n-1],{n,2,60}]] (* _Harvey P. Dale_, Dec 30 2021 *)

%K sign

%O 1,4

%A _N. J. A. Sloane_, May 30 2020

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