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!)
A240092 Sequence of numbers starting at 1 and giving a new maximum record for sigma(n) modulo n (A054024), where sigma(n) is the sum of divisors of n (A000203). 1

%I #6 Apr 01 2014 05:20:30

%S 1,2,4,8,10,14,16,26,32,44,50,52,60,64,76,92,105,110,128,136,152,170,

%T 184,225,230,232,248,256,296,315,336,376,410,424,470,472,484,512,568,

%U 584,592,630,656,688,752,792,848,884,944,976,988,1012,1024,1072,1136

%N Sequence of numbers starting at 1 and giving a new maximum record for sigma(n) modulo n (A054024), where sigma(n) is the sum of divisors of n (A000203).

%C If m is a power of 2, then sigma(m) = 2*m - 1 = m - 1, so sigma(m) == m-1 modulo m, thus giving a new record for A054024, hence A000079 is a subsequence.

%H Giovanni Resta, <a href="/A240092/b240092.txt">Table of n, a(n) for n = 1..10000</a>

%e From the first terms of A054024 : 0, 1, 1, 3, 1, 0, 1, 7, 4, 8, 1, 4, 1, 10, ... we can see the records 0, 1, 3, 7, 8, 10, ... obtained for 1, 2, 4, 8, 10, ....

%o (PARI) lista(nn) = {rec = -1; for (n=1, nn, sm = sigma(n) % n; if (sm > rec, rec = sm; print1(n, ", ");););}

%Y Cf. A000079, A000203, A054024.

%K nonn

%O 1,2

%A _Michel Marcus_, Apr 01 2014

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 June 3 10:43 EDT 2024. Contains 373060 sequences. (Running on oeis4.)