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!)
A175803 a(n) = 2^(prime(n)-2) mod prime(n+2). 2
1, 2, 8, 6, 2, 15, 16, 21, 2, 6, 20, 42, 18, 39, 13, 28, 53, 58, 4, 52, 43, 1, 70, 46, 33, 51, 23, 98, 4, 126, 39, 60, 99, 4, 23, 66, 19, 105, 98, 35, 100, 101, 177, 14, 67, 82, 83, 34, 71, 58, 233, 171, 129, 27, 86, 9, 244, 170, 241, 122, 108, 252, 291, 265, 62, 1, 299, 55, 262, 254, 7, 353, 122, 72, 34, 269, 7, 375, 250, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 2^(A000040(n)-2) mod A000040(n+2).
EXAMPLE
a(4) = 2^(prime(4)-2) mod prime(4+2) = 2^(7-2) mod 13 = 6.
MAPLE
A175803 := proc(n) 2^(ithprime(n)-2) mod ithprime(n+2) ; end proc: # R. J. Mathar, Dec 05 2010
CROSSREFS
Cf. A000040.
Sequence in context: A019771 A264643 A016594 * A019986 A146943 A028352
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms corrected by R. J. Mathar, Dec 05 2010
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 July 27 22:08 EDT 2024. Contains 374651 sequences. (Running on oeis4.)