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!)
A270573 Let c be the n-th composite number. a(n) is the number of composites d < c such that c^(d-1) == 1 (mod d) and d^(c-1) == 1 (mod c). 3
0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 3, 0, 1, 0, 0, 6, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,38
LINKS
PROG
(PARI) forcomposite(c=1, 100, my(i=0); forcomposite(d=1, c-1, if(Mod(c, d)^(d-1)==1 && Mod(d, c)^(c-1)==1, i++)); print1(i, ", "))
CROSSREFS
Sequence in context: A070097 A202523 A215935 * A096271 A285640 A231189
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Mar 19 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 16:12 EDT 2024. Contains 371254 sequences. (Running on oeis4.)