login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294389 a(n) = 2^(n-3) mod n, for n >= 3. 2
1, 2, 4, 2, 2, 0, 1, 8, 3, 8, 10, 4, 1, 0, 13, 8, 5, 12, 1, 6, 6, 8, 4, 20, 10, 16, 22, 8, 8, 0, 1, 26, 11, 8, 28, 10, 1, 32, 31, 8, 11, 24, 19, 12, 12, 32, 16, 28, 1, 28, 40, 44, 26, 32, 1, 44, 15, 32, 46, 16, 1, 0, 4, 8, 17, 36, 1, 58, 18, 8, 55, 56, 46, 40, 60, 8, 20, 32, 10, 62, 21, 8, 4, 22 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

COMMENTS

Every nonnegative integer seems to appear in the sequence, and every integer seems to appear in the sequence of first differences (see link).

LINKS

Table of n, a(n) for n=3..86.

Enrique Navarrete, Sequences Derived from Residues of 2^n (mod n)

EXAMPLE

For n=11, 2^8 = 256 == 3 mod 11.

MATHEMATICA

Array[PowerMod[2, # - 3, #] &, 80, 3] (* Robert G. Wilson v, Nov 30 2017 *)

CROSSREFS

Cf. A015910, A212844, A213859.

Sequence in context: A303118 A037178 A077748 * A152753 A113973 A123330

Adjacent sequences:  A294386 A294387 A294388 * A294390 A294391 A294392

KEYWORD

nonn

AUTHOR

Enrique Navarrete, Oct 29 2017

EXTENSIONS

More terms from Robert G. Wilson v, Nov 30 2017, who remarks that for all 3 <= n < 10^9, a(n) != 7.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 20:11 EDT 2019. Contains 327086 sequences. (Running on oeis4.)