OFFSET
0,3
COMMENTS
Consider an algorithm which finds a maximum value lcm(p1,p2,...,pk,prevmax) among all partitions {p1+p2+...+pk} of n, where the "seed number" prevmax is such a maximum value from the previous iteration.
a(n) gives the first identical value encountered, after repeated iterations, when starting from the initial seed value 1, and when starting from the initial seed value of n.
EXAMPLE
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 24 2013
STATUS
approved