A071526 Numbers k such that j mod phi(j) < k mod phi(k) for any j < k.

1, 3, 9, 15, 21, 33, 39, 45, 63, 75, 99, 117, 135, 189, 225, 231, 255, 273, 285, 345, 375, 399, 405, 435, 465, 555, 609, 615, 645, 675, 693, 705, 765, 819, 855, 915, 1005, 1035, 1095, 1125, 1185, 1215, 1245, 1275, 1395, 1425, 1515, 1545, 1605, 1617, 1665, 1725

Offset

1,2

Links

Table of n, a(n) for n=1..52.

Prog

(PARI) for(n=1, 2000, if(sum(i=1, n-1, sign(n%eulerphi(n)-i%eulerphi(i)))==n-1, print1(n, ", ")))

Crossrefs

Sequence in context: A273567 A162486 A067201 * A276967 A114271 A137164

Adjacent sequences: A071523 A071524 A071525 * A071527 A071528 A071529

Keyword

easy,nonn

Author

Benoit Cloitre, Jun 02 2002

Status

approved