login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280450 Smallest k > 2n+1 such that phi(k) = phi(2n+1). 1
4, 8, 9, 14, 22, 21, 16, 32, 27, 26, 46, 33, 38, 58, 62, 44, 39, 57, 45, 55, 49, 52, 94, 86, 64, 106, 75, 63, 118, 77, 74, 104, 134, 92, 142, 91, 82, 93, 158, 162, 166, 128, 116, 115, 95, 99, 111, 119, 122, 125, 206, 112, 214, 133, 117, 145, 178, 135, 153, 242 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All terms are composite.
LINKS
FORMULA
2n+1 < a(n) < 4n+3.
From Robert Israel, Jan 03 2017: (Start)
a(n)=2n+2 if and only if 2n+1 is in A001274.
If n > 3 is in A005384, then a(n)=4n+2. (End)
MAPLE
f:= n -> min(select(`>`, numtheory:-invphi(numtheory:-phi(2*n+1)), 2*n+1)):
map(f, [$1..100]); # Robert Israel, Jan 03 2017
MATHEMATICA
Table[k = 2 n + 2; While[EulerPhi@ k != #, k++] &@ EulerPhi[2 n + 1]; k, {n, 120}] (* Michael De Vlieger, Jan 03 2017 *)
PROG
(PARI) a(n) = my(k=2*n+2); while(eulerphi(k)!=eulerphi(2*n+1), k++); k \\ Felix Fröhlich, Jan 05 2017
CROSSREFS
Sequence in context: A182491 A281686 A122785 * A137055 A078177 A326692
KEYWORD
nonn
AUTHOR
Thomas Ordowski, Jan 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 09:18 EDT 2024. Contains 374485 sequences. (Running on oeis4.)