A181063 -id:A181063 - cp's OEIS frontend

A181064 a(n) = first of exactly n consecutive integers that each divide A181063(n).

1, 1, 1, 1, 8, 1, 1, 1, 14, 1, 14, 1, 18, 20, 1, 1, 20, 1, 24, 26, 32, 1, 30, 1, 33, 1, 32, 1, 32, 1, 1, 50, 38, 48, 38, 1, 42, 44, 42, 1, 48, 1, 54, 50, 62, 1, 50, 1, 54, 68, 62, 1, 74, 68, 72, 62, 74, 1, 62, 1, 90, 65, 1, 82, 72, 1, 72, 74, 80, 1, 80, 1, 84, 84, 82, 82, 80, 1, 84, 1, 110, 1, 90, 110, 108, 108, 104, 1, 102, 104

Offset: 1

Matthew Vandermast, Oct 07 2010

nonn

a(n)=1 iff n belongs to A181062.

A181063(n) = lcm(a(n) .. a(n)+n-1).

			The discrete string of 5 consecutive integers that divide A181063(5)=3960 begins with 8 and ends with 12; hence a(5)=8.

David W. Wilson, Table of n, a(n) for n = 1..1000

Cf. A181062, A181063.

A137921 Number of divisors d of n such that d+1 is not a divisor of n.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 2, 3, 2, 3, 4, 4, 2, 4, 2, 4, 4, 3, 2, 5, 3, 3, 4, 5, 2, 5, 2, 5, 4, 3, 4, 6, 2, 3, 4, 6, 2, 5, 2, 5, 6, 3, 2, 7, 3, 5, 4, 5, 2, 6, 4, 6, 4, 3, 2, 7, 2, 3, 6, 6, 4, 6, 2, 5, 4, 7, 2, 8, 2, 3, 6, 5, 4, 6, 2, 8, 5, 3, 2, 8, 4, 3, 4, 7, 2, 8, 4, 5, 4, 3, 4, 9, 2, 5, 6, 7, 2, 6, 2, 7, 8

Offset: 1

Reinhard Zumkeller, Feb 23 2008

a(n) = number of "divisor islands" of n. A divisor island is any set of consecutive divisors of a number where no pairs of consecutive divisors in the set are separated by 2 or more. - Leroy Quet, Feb 07 2010

			The divisors of 30 are 1,2,3,5,6,10,15,30. The divisor islands are (1,2,3), (5,6), (10), (15), (30). (Note that the differences between consecutive divisors 5-3, 10-6, 15-10 and 30-15 are all > 1.) There are 5 such islands, so a(30)=5.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Divisor Function.

Bisections: A099774, A174199.
First appearance of n is at position A173569(n).
Numbers whose divisors have no non-singleton runs are A005408.
The longest run of divisors of n has length A055874(n).
The number of successive pairs of divisors of n is A129308(n).
Cf. A000005, A001620, A027750, A060680, A088723, A088725, A181063, A199970, A328165, A328166, A328448, A328450.

a137921 n = length $ filter (> 0) $
   map ((mod n) . (+ 1)) [d | d <- [1..n], mod n d == 0]
-- Reinhard Zumkeller, Nov 23 2011

with(numtheory): disl := proc (b) local ct, j: ct := 1: for j to nops(b)-1 do if 2 <= b[j+1]-b[j] then ct := ct+1 else end if end do: ct end proc: seq(disl(divisors(n)), n = 1 .. 120); # Emeric Deutsch, Feb 12 2010

f[n_] := Length@ Split[ Divisors@n, #2 - #1 == 1 &]; Array[f, 105] (* f(n) from Bobby R. Treat *) (* Robert G. Wilson v, Feb 22 2010 *)
Table[Count[Differences[Divisors[n]],?(#>1&)]+1,{n,110}] (* _Harvey P. Dale, Jun 05 2012 *)
a[n_] := DivisorSum[n, Boole[!Divisible[n, #+1]]&]; Array[a, 100] (* Jean-François Alcover, Dec 01 2015 *)

a(n)=my(d,s=0);if(n%2,numdiv(n),d=divisors(n);for(i=1,#d,if(n%(d[i]+1),s++));s)

a(n)=sumdiv(n,d,(n%(d+1)!=0)); \\ Joerg Arndt, Jan 06 2015

from sympy import divisors
def A137921(n):
    return len([d for d in divisors(n,generator=True) if n % (d+1)])
# Chai Wah Wu, Jan 05 2015

a(n) <= A000005(n), with equality iff n is odd; a(A137922(n)) = 2.
a(n) = A000005(n) - A129308(n). - Michel Marcus, Jan 06 2015
a(n) = A001222(A328166(n)). - Gus Wiseman, Oct 16 2019
Sum_{k=1..n} a(k) ~ n * (log(n) + 2*gamma - 2), where gamma is Euler's constant (A001620). - Amiram Eldar, Jan 18 2024

Corrected and edited by Charles R Greathouse IV, Apr 19 2010

Edited by N. J. A. Sloane, Aug 10 2010

A129308 a(n) is the number of positive integers k such that k*(k+1) divides n.

Original entry on oeis.org

0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 5, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 4, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 3, 0, 1, 0, 2, 0, 2, 0, 1, 0

Offset: 1

Leroy Quet, May 26 2007

nonn

The usual OEIS policy is not to include sequences like this where alternate terms are zero; this is an exception.

In other words, a(n) is the number of oblong numbers (A002378) dividing n. - Bernard Schott, Jul 29 2022

			The divisors of 20 are 1,2,4,5,10,20. Of these there are two that are of the form k(k+1): 2 = 1*2 and 20 = 4*5. So a(2) = 2.

Ray Chandler, Table of n, a(n) for n = 1..10000
P. Erdős and R. R. Hall, On some unconventional problems on the divisors of integers, J. Austral. Math. Soc., Ser. A, 25, 479-485 (1978).
MathOverflow, On the number of consecutive divisors of an integer.

Positions of 0's and 1's are A088725, whose characteristic function is A360128.
First appearance of n is A287142(n), with sorted version A328450.
The longest run of divisors of n has length A055874(n).
One less than A195155.
Cf. A000005, A002378, A003601, A007862, A027750, A033676, A060680, A060681, A072627, A088722, A181063, A199970, A328026, A328165, A328166.
Cf. A005369, A059841, A287142, A344005.

a = {}; For[n = 1, n < 90, n++, k = 1; co = 0; While[k < Sqrt[n], If[IntegerQ[ n/(k*(k + 1))], co++ ]; k++ ]; AppendTo[a, co]]; a (* Stefan Steinerberger, May 27 2007 *)
Table[Count[Differences[Divisors[n]],1],{n,30}] (* Gus Wiseman, Oct 15 2019 *)

a(n)=sumdiv(n, d, n%(d+1)==0); \\ Michel Marcus, Jan 06 2015

from itertools import pairwise
from sympy import divisors
def A129308(n): return 0 if n&1 else sum(1 for a, b in pairwise(divisors(n)) if a+1==b) # Chai Wah Wu, Jun 09 2025

a(2n-1) = 0; a(2n) = A007862(n). - Ray Chandler, Jun 24 2008
G.f.: Sum_{n>=1} x^(n*(n+1))/(1-x^(n*(n+1))). - Joerg Arndt, Jan 30 2011 [modified by Ilya Gutkovskiy, Apr 14 2021]
a(n) = A000005(n) - A137921(n), where A137921(n) is the number of maximal runs of successive divisors of n. - Gus Wiseman, Oct 15 2019
a(n) = Sum_{d|n} A005369(d). - Ridouane Oudra, Jan 22 2021
a(n) = A195155(n)-1. - Antti Karttunen, Feb 21 2023
From Amiram Eldar, Dec 31 2023: (Start)
a(n) = A088722(n) + A059841(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 1. (End)

More terms from Stefan Steinerberger, May 27 2007

Extended by Ray Chandler, Jun 24 2008

A328166 Heinz number of the run-lengths of the divisors of n.

Original entry on oeis.org

2, 3, 4, 6, 4, 10, 4, 12, 8, 12, 4, 28, 4, 12, 16, 24, 4, 40, 4, 36, 16, 12, 4, 112, 8, 12, 16, 48, 4, 120, 4, 48, 16, 12, 16, 224, 4, 12, 16, 144, 4, 120, 4, 48, 64, 12, 4, 448, 8, 48, 16, 48, 4, 160, 16, 144, 16, 12, 4, 832, 4, 12, 64, 96, 16, 160, 4, 48, 16

Offset: 1

Gus Wiseman, Oct 07 2019

nonn

The Heinz number of an integer partition or multiset {y_1,...,y_k} is prime(y_1)*...*prime(y_k).

			Splitting the divisors of 30 into runs gives {{1, 2, 3}, {5, 6}, {10}, {15}, {30}}, and the Heinz number of {1, 1, 1, 2, 3} is 120, so a(30) = 120.
More examples from _Antti Karttunen_, Dec 09 2021: (Start)
Splitting the divisors of 1 into runs gives {1}, and the Heinz number of that is 2.
Splitting the divisors of 2 into runs gives {1, 2}, and the Heinz number of that is 3. [one run of length 2, therefore a(2) = prime(2)^1].
Splitting the divisors of 3 into runs gives {1} and {3}, and the Heinz number of that is 4. [two runs of length 1, therefore a(3) = prime(1)^2].
Splitting the divisors of 4 into runs gives {1, 2} and {4}, and the Heinz number of that is 6. [one run of length 1, and other run of length 2, therefore a(4) = prime(1)*prime(2)].
Splitting the divisors of 5 into runs gives {1} and {5}, and the Heinz number of that is 4. [two runs of length 1, therefore a(5) = prime(1)^2].
(End)

Antti Karttunen, Table of n, a(n) for n = 1..20000
Wikipedia, Run (cards)
Index entries for sequences related to Heinz numbers

The longest run of divisors of n has length A055874(n).
Numbers whose divisors > 1 have no non-singleton runs are A088725.
The number of successive pairs of divisors of n is A129308(n).
The Heinz number of the set of divisors of n is A275700(n).
Numbers whose divisors do not have weakly decreasing run-lengths are A328165.
Cf. A000005, A056239, A060680, A060775, A119313, A137921, A181063, A199970.

Table[Times@@Prime/@Length/@Split[Divisors[n],#2==#1+1&],{n,30}]

A328166(n) = { my(rl=0,pd=0,v=vector(numdiv(n)),m=1); fordiv(n, d, if(d>(1+pd), v[rl]++; rl=0); pd=d; rl++); v[rl]++; for(i=1,#v, m *= prime(i)^v[i]); (m); }; \\ Antti Karttunen, Dec 09 2021

A001222(a(n)) = A137921(n).

A056239(a(n)) = A000005(n).

A181062 Prime powers minus 1.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 15, 16, 18, 22, 24, 26, 28, 30, 31, 36, 40, 42, 46, 48, 52, 58, 60, 63, 66, 70, 72, 78, 80, 82, 88, 96, 100, 102, 106, 108, 112, 120, 124, 126, 127, 130, 136, 138, 148, 150, 156, 162, 166, 168, 172, 178, 180, 190, 192, 196, 198, 210, 222, 226

Offset: 1

Matthew Vandermast, Oct 07 2010

If 0 is excluded, a(n) gives the possible lengths of the longest string of consecutive divisors of a positive integer: range of values of A055874.
a(n) is the largest number m such that A051451(n) = A003418(m).
From Jianing Song, Nov 01 2023: (Start)
Let q = A000961(n) for n > 1. Then:
 - a(n) is the number of units in the finite field F_q.
 - a(n) is the number of solutions to x*y = t for any t != 0 in F_q.
 - If q is odd, then a(n) is also the number of solutions to x^2 - y^2 = t for any t != 0 in F_q. (End)

			Any integer that is divisible by 5 consecutive integers will be divisible by at least 6 consecutive integers. Hence 5 is not in the sequence.

Matthew House, Table of n, a(n) for n = 1..10000

Cf. A000961, A181063, A181064, A181121.
Includes A006093 as a subsequence.
Cf. A003418, A051451, A055874.

Join[{0}, Select[Range@225, PrimePowerQ] - 1] (* Ivan Neretin, Aug 04 2016 *)

isA181062(n)=ispower(n++,,&n);isprime(n) \\ Charles R Greathouse IV, Jun 29 2011

isok(n) = (n==0) || isprimepower(n++); \\ Michel Marcus, Aug 05 2016

a(n) = A000961(n)-1.

Entry revised by N. J. A. Sloane, Jan 06 2013

A328457 Length of the longest run of divisors > 1 of n.

Original entry on oeis.org

0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 5, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1

Offset: 1

Gus Wiseman, Oct 16 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..100000

Records occur at A328448.
Positions of 0's and 1's are A088725.
The version that looks at all divisors (including 1) is A055874.
The number of successive pairs of divisors > 1 of n is A088722(n).
The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
The longest run of nontrivial divisors of n is A328458(n).
Cf. A000005, A027750, A129308, A181063, A199970, A328162, A328195, A328449, A360128.

Table[If[n==1,0,Max@@Length/@Split[Rest[Divisors[n]],#2==#1+1&]],{n,100}]

A328457(n) = { my(rl=0,pd=0,m=0); fordiv(n, d, if(d>1, if(d>(1+pd), m = max(m,rl); rl=0); pd=d; rl++)); max(m,rl); }; \\ Antti Karttunen, Feb 23 2023

Data section extended up to a(105) by Antti Karttunen, Feb 23 2023

A328448 Smallest number whose divisors > 1 have a longest run of length n, and 0 if none exists.

Original entry on oeis.org

2, 6, 12, 504, 60, 420, 840, 4084080, 2520, 21162960, 27720, 2059318800, 0, 360360, 720720, 8494326640800, 12252240, 281206918792800, 0, 0, 232792560, 409547311252279200, 5354228880, 619808900849199341280, 26771144400, 54749786241679275146400, 80313433200, 5663770990518545704800

Offset: 1

Gus Wiseman, Oct 16 2019

nonn

			The runs of divisors of 504 (greater than 1) are {{2,3,4},{6,7,8,9},{12},{14},{18},{21},{24},{28},{36},{42},{56},{63},{72},{84},{126},{168},{252},{504}}, the longest of which has length 4, and 504 is the smallest number with this property, so a(4) = 504.

The version that looks at all divisors (including 1) is A328449.
The longest run of divisors of n greater than 1 has length A328457.
Numbers whose divisors > 1 have no non-singleton runs are A088725.
The number of successive pairs of divisors of n is A129308(n).
The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
Cf. A000005, A027750, A055874, A060680, A181063, A199970, A328450.

Data corrected and extended by Giovanni Resta, Oct 18 2019

A328449 Smallest number in whose divisors the longest run is of length n, and 0 if none exists.

Original entry on oeis.org

0, 1, 2, 6, 12, 0, 60, 420, 840, 0, 2520, 0, 27720, 0, 0, 360360, 720720, 0, 12252240, 0, 0, 0, 232792560, 0, 5354228880, 0, 26771144400, 0, 80313433200, 0, 2329089562800, 72201776446800, 0, 0, 0, 0, 144403552893600, 0, 0, 0, 5342931457063200, 0

Offset: 0

Gus Wiseman, Oct 16 2019

nonn

Wikipedia, Run (cards)

Positions of 0's are 0 followed by A024619 - 1.
The version that looks only at all divisors > 1 is A328448.
The longest run of divisors of n has length A055874.
The longest run of divisors of n greater than one has length A328457.
Numbers whose divisors have no non-singleton runs are A005408.
The number of successive pairs of divisors of n is A129308(n).
The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
The smallest number whose divisors have a (not necessarily longest) maximal run of length n is A181063.
Cf. A000005, A003601, A027750, A033676, A060680, A060681, A199970, A328195.

tav=Table[Max@@Length/@Split[Divisors[n],#2==#1+1&],{n,10000}];
Table[If[FreeQ[tav,i],0,Position[tav,i][[1,1]]],{i,0,Max@@tav}]

a(n) = LCM(1,2,...,n) = A003418(n) if n + 1 is a prime power, otherwise a(n) = 0.

A328165 Numbers whose divisors do not have weakly decreasing run-lengths.

Original entry on oeis.org

56, 72, 110, 112, 132, 144, 156, 182, 210, 216, 224, 240, 264, 272, 288, 306, 312, 342, 364, 380, 392, 396, 420, 432, 440, 448, 462, 468, 480, 506, 528, 544, 550, 552, 576, 600, 612, 616, 624, 648, 650, 684, 702, 720, 728, 756, 760, 770, 780, 784, 792, 812

Offset: 1

Gus Wiseman, Oct 07 2019

nonn

			The divisors of 56 are {1, 2, 4, 7, 8, 14, 28, 56}, with runs {{1, 2}, {4}, {7, 8}, {14}, {28}, {56}}, with lengths (2, 1, 2, 1, 1, 1), which are not weakly decreasing, so 56 is in the sequence.

Wikipedia, Run (cards)

The longest run of divisors of n has length A055874(n).
Numbers whose divisors > 1 have no non-singleton runs are A088725.
The number of successive pairs of divisors of n is A129308(n).
The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
Cf. A000005, A027750, A033676, A060680, A060775, A119313, A181063, A199970.

Select[Range[1000],!GreaterEqual@@Length/@Split[Divisors[#],#2==#1+1&]&]

A328450 Numbers that are a smallest number with k pairs of successive divisors, for some k.

Original entry on oeis.org

1, 2, 6, 12, 60, 72, 180, 360, 420, 840, 1260, 2520, 3780, 5040, 13860, 27720, 36960, 41580, 55440, 83160, 166320, 277200, 360360, 471240, 491400, 720720, 1081080, 1113840, 2162160, 2827440, 3341520, 4324320, 5405400, 6126120

Offset: 0

Gus Wiseman, Oct 15 2019

nonn

A sorted version of A287142.

			The divisors of 72 are {1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72}, with pairs of successive divisors {{1, 2}, {2, 3}, {3, 4}, {8, 9}}, and no smaller number has 4 successive pairs, so 72 belongs to the sequence.

Sorted positions of first appearances in A129308.
The longest run of divisors of n has length A055874(n).
Numbers whose divisors > 1 have no non-singleton runs are A088725.
The Heinz number of the multiset of run-lengths of divisors of n is A328166(n).
The smallest number whose divisors have a longest run of length n is A328449(n).
Cf. A000005, A003601, A027750, A033676, A060680, A060681, A072627, A181063, A199970, A287142, A328165.

dat=Table[Count[Differences[Divisors[n]],1],{n,10000}];
Sort[Table[Position[dat,i][[1,1]],{i,Union[dat]}]]

cp's OEIS Frontend

A181064 a(n) = first of exactly n consecutive integers that each divide A181063(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A137921 Number of divisors d of n such that d+1 is not a divisor of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A129308 a(n) is the number of positive integers k such that k*(k+1) divides n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A328166 Heinz number of the run-lengths of the divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A181062 Prime powers minus 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A328457 Length of the longest run of divisors > 1 of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A328448 Smallest number whose divisors > 1 have a longest run of length n, and 0 if none exists.

Views

Author

Keywords