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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015919 Positive integers n such that 2^n == 2 (mod n). 15
1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 341, 347, 349, 353, 359, 367 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Includes 341 which is first pseudoprime to base 2 and distinguishes sequence from A008578.

LINKS

Table of n, a(n) for n=1..75.

FORMULA

A015919 = {1} U A000040 U A001567 = A001567 U A008578. - Ray Chandler, Dec 07 2003

PROG

(PARI) is(n)=Mod(2, n)^n==2 \\ Charles R Greathouse IV, Mar 11 2014

CROSSREFS

Cf. A000040, A001567, A008578.

Sequence in context: A216885 A216886 A100726 * A064555 A216887 A095320

Adjacent sequences:  A015916 A015917 A015918 * A015920 A015921 A015922

KEYWORD

nonn

AUTHOR

Robert G. Wilson v

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified December 22 11:14 EST 2014. Contains 252355 sequences.