This site is supported by donations to The OEIS Foundation.

 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
 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, 24, 24, 29, 28, 29, 31, 38, 36, 38, 38, 43, 41, 41, 46, 45, 47, 45, 48, 47, 47, 45, 47, 48, 48, 46, 49, 53, 51, 57, 58, 65, 55, 58, 65, 59, 57, 63, 60, 60, 63, 67, 68 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 EXAMPLE 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. CROSSREFS Cf. A283565. Sequence in context: A284630 A081622 A064143 * A115274 A126890 A122637 Adjacent sequences:  A283590 A283591 A283592 * A283594 A283595 A283596 KEYWORD nonn AUTHOR Rémy Sigrist, Mar 11 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 02:35 EDT 2019. Contains 323579 sequences. (Running on oeis4.)