login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268597 Smallest x such that x-1 mod phi(x) = n, or 0 if no such x exists. 0
1, 4, 9, 8, 25, 18, 15, 16, 21, 50, 35, 36, 33, 98, 39, 32, 65, 54, 51, 100, 45, 70, 95, 72, 69, 338, 63, 196, 161, 110, 87, 64, 93, 130, 75, 108, 217, 182, 99, 200, 185, 170, 123, 140, 117, 190, 215, 144, 141, 250, 235 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Conjecture: a(n) > 0 for all n.

LINKS

Table of n, a(n) for n=0..50.

PROG

(PARI) a(n) = {my(x = 1); while ((x-1) % eulerphi(x) != n, x++); x; } \\ Michel Marcus, Feb 27 2016

CROSSREFS

Cf. A215486.

Sequence in context: A118585 A067666 A280286 * A253560 A050399 A072995

Adjacent sequences:  A268594 A268595 A268596 * A268598 A268599 A268600

KEYWORD

nonn

AUTHOR

Christina Steffan, Feb 08 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 30 15:43 EDT 2020. Contains 334726 sequences. (Running on oeis4.)