OFFSET
0,3
LINKS
Wikipedia, Run (cards)
FORMULA
a(n) = LCM(1,2,...,n) = A003418(n) if n + 1 is a prime power, otherwise a(n) = 0.
MATHEMATICA
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}]
CROSSREFS
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.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Oct 16 2019
STATUS
approved