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!)
A283593 Least m > 0 such that A283565(n) = Sum_{k=1..m} (A283565(n) mod k). 2

%I #7 Mar 11 2017 21:20:38

%S 1,2,3,5,7,6,7,7,8,9,10,8,12,11,13,15,14,15,16,20,17,20,22,25,25,25,

%T 24,24,29,28,29,31,38,36,38,38,43,41,41,46,45,47,45,48,47,47,45,47,48,

%U 48,46,49,53,51,57,58,65,55,58,65,59,57,63,60,60,63,67,68

%N Least m > 0 such that A283565(n) = Sum_{k=1..m} (A283565(n) mod k).

%H Rémy Sigrist, <a href="/A283593/b283593.txt">Table of n, a(n) for n = 1..10000</a>

%e A283565(4)=7 and (7 mod 1) + (7 mod 2) + (7 mod 3) + (7 mod 4) + (7 mod 5) = 0 + 1 + 1 + 3 + 2 = 7, hence a(4)=5.

%Y Cf. A283565.

%K nonn

%O 1,2

%A _Rémy Sigrist_, Mar 11 2017

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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)