A332561 -id:A332561 - cp's OEIS frontend

A332558 a(n) is the smallest k such that n(n+1)(n+2)...(n+k) is divisible by n+k+1.

4, 3, 2, 3, 4, 5, 4, 3, 5, 4, 6, 5, 6, 5, 4, 7, 6, 5, 4, 3, 6, 7, 6, 5, 4, 8, 7, 6, 6, 5, 8, 7, 6, 5, 4, 8, 7, 6, 5, 7, 6, 5, 10, 9, 8, 9, 8, 7, 6, 9, 8, 7, 6, 5, 4, 6, 12, 11, 10, 9, 8, 7, 6, 7, 6, 5, 12, 11, 10, 9, 8, 7, 6, 5, 8, 7, 6, 11, 10, 9, 8, 7, 6, 5

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Feb 24 2020

This is a multiplicative analog of A332542.

a(n) always exists because one can take k to be 2^m - 1 for m large.

Robert Israel, Table of n, a(n) for n = 1..10000
David A. Corneth, PARI program
J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004.14000 [math.NT], April 2020.

Cf. A061836 (k+1), A332559 (n+k+1), A332560 (the final product), A332561 (the quotient).
For records, see A333532 and A333533 (and A333537), which give the records in the essentially identical sequence A061836.
Additive version: A332542, A332543, A332544, A081123.
"Concatenate in base 10" version: A332580, A332584, A332585.

f:= proc(n) local k,p;
  p:= n;
  for k from 1 do
    p:= p*(n+k);
    if (p/(n+k+1))::integer then return k fi
  od
end proc:
map(f, [$1..100]); # Robert Israel, Feb 25 2020

a[n_] := Module[{k, p = n}, For[k = 1, True, k++, p *= (n+k); If[Divisible[p, n+k+1], Return[k]]]];
Array[a, 100] (* Jean-François Alcover, Jun 04 2020, after Maple *)

a(n) = {my(r=n*(n+1)); for(k=2, oo, r=r*(n+k); if(r%(n+k+1)==0, return(k))); } \\ Jinyuan Wang, Feb 25 2020

PARI
```
\\ See Corneth link
```

def a(n):
    k, p = 1, n*(n+1)
    while p%(n+k+1): k += 1; p *= (n+k)
    return k
print([a(n) for n in range(1, 85)]) # Michael S. Branicky, Jun 06 2021

a(n) = A061836(n) - 1 for n >= 1.

a(n + 1) >= a(n) - 1. a(n + 1) = a(n) - 1 mostly. - David A. Corneth, Apr 14 2020

A332542 a(n) is the smallest k such that n+(n+1)+(n+2)+...+(n+k) is divisible by n+k+1.

Original entry on oeis.org

2, 7, 14, 3, 6, 47, 14, 4, 10, 20, 25, 11, 5, 31, 254, 15, 18, 55, 6, 10, 22, 44, 14, 23, 11, 7, 86, 27, 30, 959, 62, 16, 34, 8, 73, 35, 17, 24, 163, 39, 42, 127, 9, 22, 46, 92, 62, 19, 23, 15, 158, 51, 10, 20, 75, 28, 58, 116, 121, 59, 29, 127, 254, 11

Offset: 3

Scott R. Shannon, Feb 18 2020

nonn

Note that (n+(n+1)+(n+2)+...+(n+k))/(n+k+1) = A332544(n)/(n+k+1) = A082183(n-1). See the Myers et al. link for proof. - N. J. A. Sloane, Apr 30 2020

We can always take k = n^2-2*n-1, for then the sum in the definition becomes (n+1)*n*(n-1)*(n-2)/2, which is an integral multiple of n+k+1 = n*(n-1). So a(n) always exists. - N. J. A. Sloane, Feb 20 2020

			n=4: we get 4 -> 4+5=9 -> 9+6=15 -> 15+7=22 -> 22+8=30 -> 30+9=39 -> 39+10=49 -> 49+11=60, which is divisible by 12, and took k=7 steps, so a(4) = 7. Also A332543(4) = 12, A332544(4) = 60, and A082183(3) = 60/12 = 5.

Seiichi Manyama, Table of n, a(n) for n = 3..10000
J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004:14000 [math.NT], 2020-2021.

Cf. A332543, A332544, A082183.

See A332558-A332561 for a multiplicative analog.

grow2 := proc(n,M) local p,q,k; # searches out to a limit of M
# returns n, k (A332542(n)), n+k+1 (A332543(n)), p (A332544(n)), and q (which appears to match A082183(n-1))
for k from 1 to M do
   if ((k+1)*n + k*(k+1)/2) mod (n+k+1) = 0 then
   p := (k+1)*n+k*(k+1)/2;
   q := p/(n+k+1); return([n,k,n+k+1,p,q]);
   fi;
od:
# if no success, return -1's
[n,-1,-1,-1,-1]; end; # N. J. A. Sloane, Feb 18 2020

a[n_] := NestWhile[#1+1&,0,!IntegerQ[Divide[(#+1)*n+#*(#+1)/2,n+#+1]]&]
a/@Range[3,100] (* Bradley Klee, Apr 30 2020 *)

a(n) = my(k=1); while (sum(i=0, k, n+i) % (n+k+1), k++); k; \\ Michel Marcus, Aug 26 2021

def a(n):
    k, s = 1, 2*n+1
    while s%(n+k+1) != 0: k += 1; s += n+k
    return k
print([a(n) for n in range(3, 67)]) # Michael S. Branicky, Aug 26 2021

def A(n)
  s = n
  t = n + 1
  while s % t > 0
    s += t
    t += 1
  end
  t - n - 1
end
def A332542(n)
  (3..n).map{|i| A(i)}
end
p A332542(100) # Seiichi Manyama, Feb 19 2020

A332559 a(n) = n + A332558(n) + 1.

Original entry on oeis.org

6, 6, 6, 8, 10, 12, 12, 12, 15, 15, 18, 18, 20, 20, 20, 24, 24, 24, 24, 24, 28, 30, 30, 30, 30, 35, 35, 35, 36, 36, 40, 40, 40, 40, 40, 45, 45, 45, 45, 48, 48, 48, 54, 54, 54, 56, 56, 56, 56, 60, 60, 60, 60, 60, 60, 63, 70, 70, 70, 70, 70, 70, 70, 72, 72, 72

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Feb 24 2020

nonn

Robert Israel, Table of n, a(n) for n = 1..10000
J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004:14000 [math.NT], April 2020.

Cf. A061836, A332558, A332560, A332561.

f:= proc(n) local k,p;
  p:= n;
  for k from 1 do
    p:= p*(n+k);
    if (p/(n+k+1))::integer then return n+k+1 fi
  od
end proc:
map(f, [$1..100]); # Robert Israel, Feb 25 2020

a[n_] := Module[{k, p = n}, For[k = 1, True, k++, p *= (n+k); If[Divisible[p, n+k+1], Return[n+k+1]]]];
Array[a, 100] (* Jean-François Alcover, Jul 18 2020, after Maple *)

def a(n):
    k, p = 1, n*(n+1)
    while p%(n+k+1): k += 1; p *= (n+k)
    return n + k + 1
print([a(n) for n in range(1, 67)]) # Michael S. Branicky, Jun 06 2021

A333537 Greatest prime factor of A332559.

Original entry on oeis.org

3, 3, 3, 2, 5, 3, 3, 3, 5, 5, 3, 3, 5, 5, 5, 3, 3, 3, 3, 3, 7, 5, 5, 5, 5, 7, 7, 7, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 5, 5, 13, 7, 7, 7, 7, 7, 7, 7, 3, 7, 7, 7, 7, 7, 7, 5

Offset: 1

N. J. A. Sloane, Apr 12 2020

nonn

For rate of growth, see the Myers et al. link. - N. J. A. Sloane, Apr 30 2020

N. J. A. Sloane, Table of n, a(n) for n = 1..10000.
J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004:14000 [math.NT], April 2020.

Cf. A006530, A061836, A332558, A332559, A332560, A332561.

For records see A333538, A333541, A333542.

a[n_] := Module[{k, p = n}, For[k = 1, True, k++, p *= (n+k); If[Divisible[ p, n+k+1], Return[FactorInteger[n+k+1][[-1, 1]]]]]];
Array[a, 1000] (* Jean-François Alcover, Aug 17 2020 *)

A332560 a(n) = (n + A332558(n))!/(n-1)!.

Original entry on oeis.org

120, 120, 60, 840, 15120, 332640, 55440, 7920, 2162160, 240240, 98017920, 8910720, 253955520, 19535040, 1395360, 19769460480, 1235591280, 72681840, 4037880, 212520, 4475671200, 173059286400, 7866331200, 342014400, 14250600, 19033511777280, 732058145280

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Feb 24 2020

Jinyuan Wang, Table of n, a(n) for n = 1..10000
J. S. Myers, R. Schroeppel, S. R. Shannon, N. J. A. Sloane, and P. Zimmermann, Three Cousins of Recaman's Sequence, arXiv:2004:14000, April 2020

Cf. A061836, A332558, A332559, A332561.

a(n) = {my(r=n*(n+1)); for(k=2, oo, r=r*(n+k); if(r%(n+k+1)==0, return((n+k)!/(n-1)!))); } \\ Jinyuan Wang, Feb 25 2020

cp's OEIS Frontend

A332558 a(n) is the smallest k such that n*(n+1)*(n+2)*...*(n+k) is divisible by n+k+1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

A332542 a(n) is the smallest k such that n+(n+1)+(n+2)+...+(n+k) is divisible by n+k+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Ruby

A332559 a(n) = n + A332558(n) + 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Python

A333537 Greatest prime factor of A332559.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A332560 a(n) = (n + A332558(n))!/(n-1)!.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A332558 a(n) is the smallest k such that n(n+1)(n+2)...(n+k) is divisible by n+k+1.