This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074483 Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number y such that b(k,n)-b(k-1,n) is a constant (= A074482(n)) for k > y. Sequence gives values of y. 3
 397, 396, 395, 4, 11, 10, 25, 24, 29, 14, 5, 26, 25, 10, 7, 16, 68265, 14, 13, 12, 17, 1220, 67, 136, 93, 6, 133, 132, 9, 272, 129, 14, 1209, 126, 125, 124, 48605, 48604, 269393, 269392, 292695, 180, 77, 178, 177, 269386, 24017, 72, 24015, 172, 67, 44, 11, 16, 65 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Conjecture: a(n) is defined for all n (as well as A074482); A074484(n) = A074482(n)*(a(n)+ n + 1); b(k, n) = A074482(n)*(k + n + 1) for k > a(n). LINKS David W. Wilson, Table of n, a(n) for n = 0..10000 EXAMPLE A074482(0) = A073117(a(0)) mod a(0) = A073117(397) mod 397 = 38606 mod 397 = 97. CROSSREFS Cf. A073117. Sequence in context: A034621 A203926 A270842 * A023326 A139385 A142372 Adjacent sequences:  A074480 A074481 A074482 * A074484 A074485 A074486 KEYWORD nonn AUTHOR Reinhard Zumkeller and Benoit Cloitre, Aug 23 2002 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 August 20 22:45 EDT 2019. Contains 326155 sequences. (Running on oeis4.)