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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096196 a(n) = (1 + 2^n) mod n. 6
0, 1, 0, 1, 3, 5, 3, 1, 0, 5, 3, 5, 3, 5, 9, 1, 3, 11, 3, 17, 9, 5, 3, 17, 8, 5, 0, 17, 3, 5, 3, 1, 9, 5, 19, 29, 3, 5, 9, 17, 3, 23, 3, 17, 18, 5, 3, 17, 31, 25, 9, 17, 3, 29, 44, 33, 9, 5, 3, 17, 3, 5, 9, 1, 33, 65, 3, 17, 9, 45, 3, 65, 3, 5, 69, 17, 19, 65, 3, 17, 0, 5, 3, 65, 33, 5, 9, 81, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Michael De Vlieger, Table of n, a(n) for n = 1..10000

OEIS Wiki, 2^n mod n

MAPLE

seq(1 + 2 &^ n mod n, n = 1 .. 250); # Robert Israel, Dec 10 2015

MATHEMATICA

Table[Mod[1 + Mod[2, n]^n, n], {n, 89}] (* Michael De Vlieger, Dec 10 2015 *)

PROG

(PARI) a(n)=(1+2^n)%n \\ Anders Hellström, Dec 10 2015

(PARI) a(n)=lift(1+Mod(2, n)^n); \\ Michel Marcus, Dec 12 2015

(Magma) [(1+2^n) mod (n): n in [1..100]]; // Vincenzo Librandi, Dec 11 2015

CROSSREFS

Cf. A006521, A015910, A082495.

Sequence in context: A188815 A010615 A114865 * A351179 A076824 A103728

Adjacent sequences: A096193 A096194 A096195 * A096197 A096198 A096199

KEYWORD

nonn,easy

AUTHOR

Labos Elemer, Jul 26 2004

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 December 3 01:25 EST 2022. Contains 358510 sequences. (Running on oeis4.)