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!)
A291530 a(n) is the smallest k such that uphi(k*n) = uphi(k*n+1), or 0 if no such k exists. 0
1, 10, 373, 5, 4, 372, 5, 26, 248, 2, 13, 186, 11, 562, 247, 13, 627, 124, 195, 1, 183, 86, 245, 93, 5184, 8, 185, 281, 1623, 4320, 72, 738, 43, 2296, 1, 62, 20, 2312, 95, 3240, 576, 732, 33, 43, 111, 4600, 540100, 492, 115, 2592, 209, 4, 25383, 2388, 629, 549, 65, 1732, 64476, 2160, 20, 36, 61 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

a(3) = 373 because uphi(373*3) = uphi(373*3+1) and 373 is the smallest number with this property.

PROG

(PARI) uphi(n) = my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[1, 2]-1);

a(n) = {my(k = 1); while (uphi(k*n) != uphi(k*n+1), k++); k; }

CROSSREFS

Cf. A047994, A275412, A287055.

Sequence in context: A119547 A117797 A301311 * A117312 A200804 A277663

Adjacent sequences:  A291527 A291528 A291529 * A291531 A291532 A291533

KEYWORD

nonn

AUTHOR

Altug Alkan, Aug 25 2017

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 July 11 17:52 EDT 2020. Contains 335626 sequences. (Running on oeis4.)