login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A303579
Break up the list of values of the Euler totient function phi(k) into nondecreasing runs; sequence gives lengths of successive runs.
3
5, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
OFFSET
1,1
LINKS
EXAMPLE
The initial values of d(k) = A000010(k) for k = 1,2,3,... are
1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4, 12, 6, 8, 8, 16, 6, 18, 8, 12, 10, 22, 8, 20, 12, 18, 12, 28, 8, 30, 16, 20, 16, 24, 12, 36, 18, 24, 16, 40, 12, 42, 20, 24, ...
Breaking this up into nondecreasing runs we get:
[1, 1, 2, 2, 4], [2, 6], [4, 6], [4, 10], [4, 12], [6, 8, 8, 16], [6, 18], [8, 12], [10, 22], [8, 20], [12, 18], [12, 28], [8, 30], [16, 20], [16, 24], [12, 36], [18, 24], [16, 40], [12, 42], [20, 24], [22, 46], [16, 42], [20, 32], [24, 52], [18, 40], [24, 36], [28, 58], [16, 60], [30, 36], [32, 48], [20, 66], [32, 44], [24, 70], [24, 72], [36, 40], ...
whose successive lengths are
5, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, ...
PROG
(PARI) upto(n) = {my(res = List(), t = 1, l = 1); for(i = 2, n, el = eulerphi(i); if(el >= l, t++, listput(res, t); t = 1); l = el); res} \\ David A. Corneth, Apr 29 2018
CROSSREFS
Cf. A000010.
A303580(m) gives value of n that starts the m-th run.
For run lengths in this sequence see A302441.
Sequence in context: A190288 A325499 A081119 * A306966 A286016 A119320
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 29 2018
EXTENSIONS
More terms from Seiichi Manyama, Apr 29 2018
STATUS
approved