The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A098475 a(n) is the smallest integer k for which sigma_n(k) <= sigma_n(k-1) where sigma_n(k) = sum of the n-th powers of the divisors of k. 1

%I #6 Aug 18 2013 03:24:28

%S 3,5,7,25,61,145,361,853,1969,4489,10069,22273,48781,105949,228589,

%T 490405,1046977,2225965,4715401,9956977,20965213,44031361,92262349,

%U 192920785,402629257,838827577,1744784389,3623814865,7516104565

%N a(n) is the smallest integer k for which sigma_n(k) <= sigma_n(k-1) where sigma_n(k) = sum of the n-th powers of the divisors of k.

%C a(n) has to be larger than the solution to Zeta(n)*(x-1)^n=x^n.

%e a(1)=5 since sigma(1)=1,sigma(2)=3,sigma(3)=4, sigma(4)=7, but sigma(5)=6.

%o (PARI) a(n) = {my(k = 2); while(sigma(k, n) > sigma(k-1, n), k++); k;} \\ _Michel Marcus_, Aug 18 2013

%K nonn

%O 0,1

%A _John L. Drost_, Oct 26 2004

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 May 22 06:48 EDT 2024. Contains 372743 sequences. (Running on oeis4.)