A074482 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 x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.

97, 97, 97, 1, 3, 3, 6, 6, 8, 4, 1, 8, 8, 3, 2, 5, 17143, 5, 3, 4, 5, 316, 22, 41, 28, 1, 41, 41, 3, 74, 39, 5, 316, 37, 37, 37, 12178, 12178, 67382, 67382, 73191, 52, 25, 51, 50, 67382, 6001, 25, 6001, 51, 22, 17, 2, 5, 23, 50, 1, 50, 50, 14, 50, 492, 20, 50, 20, 52, 17, 17143

Offset

0,1

Comments

Conjecture: a(n) is defined for all n (as well as A074483);

A074484(n) = a(n)*(A074483(n)+ n + 1);

b(k, n) = a(n)*(k + n + 1) for k > A074483(n).

Links

David W. Wilson, Table of n, a(n) for n = 0..10000

Example

a(0) = A073117(A074483(0)) mod A074483(0) = A073117(397) mod 397 = 38606 mod 397 = 97.

Crossrefs

Cf. A073117.

Sequence in context: A112667 A106419 A253387 * A130765 A111326 A031313

Adjacent sequences: A074479 A074480 A074481 * A074483 A074484 A074485

Keyword

nonn

Author

Reinhard Zumkeller and Benoit Cloitre, Aug 23 2002

Status

approved