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!)
A175156 a(n) = 2^(n-1) mod composite(n). 1
1, 2, 4, 8, 6, 8, 8, 8, 0, 8, 4, 11, 4, 8, 9, 8, 7, 4, 4, 0, 1, 32, 9, 32, 26, 2, 24, 8, 36, 32, 26, 32, 39, 42, 4, 20, 28, 7, 32, 8, 36, 32, 4, 2, 0, 57, 64, 60, 16, 2, 40, 60, 46, 48, 71, 50, 16, 8, 72, 32, 16, 32, 64, 8, 16, 32, 24, 35, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
PROG
(PARI) lista(nn) = {compo = select(n->(! isprime(n) && (n != 1)), vector(nn, i, i)); for (i = 1, #compo, print1(2^(i-1) % compo[i], ", "); ); } \\ Michel Marcus, Sep 11 2013
CROSSREFS
Sequence in context: A246631 A320153 A138284 * A320152 A352763 A022478
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Michel Marcus, Sep 11 2013
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 April 24 13:24 EDT 2024. Contains 371955 sequences. (Running on oeis4.)