Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)

Revision History for A328413

(Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A328413 Numbers k such that (Z/mZ)* = C_2 X C_(2k) has solutions m, where (Z/mZ)* is the multiplicative group of integers modulo m.
(history; published version)
#6 by N. J. A. Sloane at Fri Oct 18 17:06:09 EDT 2019
STATUS

proposed

approved

#5 by Jianing Song at Fri Oct 18 10:30:33 EDT 2019
STATUS

editing

proposed

#4 by Jianing Song at Fri Oct 18 10:18:55 EDT 2019
COMMENTS

For n > 1, it is easy to see A114871(n)/2 is a term of this sequence. The smallest term here not of the form A114871(k)/2 is 24: 48 is not of the form (p-1)*p^k for any prime p, but (Z/mZ)* = C_2 X C_48 has solutions m = 119, 153, 238, 306.

EXAMPLE

(Z/mZ)* = C_2 X C_2 has solutions m = 8, 12; (Z/mZ)* = C_2 X C_4 has solutions m = 15, 16, 20, 30; (Z/mZ)* = C_2 X C_6 has solutions m = 21, 28, 36, 42; (Z/mZ)* = C_2 X C_8 has solutions m = 32; (Z/mZ)* = C_2 X C_10 has solutions m = 33, 44, 66; (Z/mZ)* = C_2 X C_12 has solutions m = 35, 39, 45, 52, 70, 78, 90. So 1, 2, 3, 4, 5, 6 are all terms.

CROSSREFS

Cf. A328412. Complement of A328414.

Cf. also A114871.

#3 by Jianing Song at Tue Oct 15 01:42:27 EDT 2019
NAME

Numbers k such that (Z/mZ)* = C_2 X C_(2k) has solutions m, where (Z/mZ)* is the multiplicative group of integers modulo m.

PROG

(PARI) isA328413(n) = my(r=4*n, N=floor(exp(Euler)*r*log(log(r^2))+2.5*r/log(log(r^2)))); for(k=r+1, N+1, if(eulerphi(k)==r && lcm(znstar(k)[2])==r/2, return(1)); if(k==N+1, return(0)))

#2 by Jianing Song at Mon Oct 14 23:30:27 EDT 2019
NAME

allocatedNumbers k such that (Z/mZ)* = C_2 X forC_(2k) has Jianingsolutions Songm.

DATA

1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 14, 15, 16, 18, 20, 21, 22, 23, 24, 26, 27, 29, 30, 32, 33, 35, 36, 39, 40, 41, 42, 44, 45, 46, 48, 50, 51, 53, 54, 55, 56, 58, 60, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 78, 81, 82, 83, 86, 87, 88, 89, 90, 95, 96, 98, 99, 102, 105, 106, 110, 111

OFFSET

1,2

PROG

(PARI) isA328413(n) = my(r=4*n, N=floor(exp(Euler)*r*log(log(r^2))+2.5*r/log(log(r^2)))); for(k=r+1, N, if(eulerphi(k)==r && lcm(znstar(k)[2])==r/2, return(1)); if(k==N, return(0)))

for(n=1, 100, if(isA328413(n), print1(n, ", ")))

KEYWORD

allocated

nonn

AUTHOR

Jianing Song, Oct 14 2019

STATUS

approved

editing

#1 by Jianing Song at Mon Oct 14 23:02:05 EDT 2019
NAME

allocated for Jianing Song

KEYWORD

allocated

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 August 18 20:50 EDT 2024. Contains 375284 sequences. (Running on oeis4.)