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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015931 Positive integers n such that 2^n == 2^9 (mod n). 6
1, 2, 3, 4, 5, 8, 9, 16, 17, 21, 27, 32, 45, 63, 64, 99, 105, 117, 124, 128, 153, 171, 189, 207, 254, 256, 261, 273, 279, 333, 369, 387, 423, 429, 477, 512, 513, 531, 549, 585, 603, 639, 657, 711, 747, 801, 873, 909, 927, 945, 963, 981, 1017, 1143, 1179, 1197, 1209, 1233, 1251, 1341, 1359, 1365, 1413, 1467, 1472, 1503, 1504, 1557, 1611, 1629, 1665, 1719, 1737, 1773, 1785, 1791, 1899, 1971 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For all m, 2^A128123(m)-1 belongs to this sequence.

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..10000

OEIS Wiki, 2^n mod n

PROG

(PARI) isok(n) = Mod(2, n)^n == 2^9; \\ Michel Marcus, Sep 23 2016

CROSSREFS

Contains A208157 as a subsequence.

The odd terms form A276970.

Sequence in context: A054168 A085152 A264886 * A263581 A120430 A152606

Adjacent sequences:  A015928 A015929 A015930 * A015932 A015933 A015934

KEYWORD

nonn

AUTHOR

Robert G. Wilson v

EXTENSIONS

Edited by Max Alekseyev, Jul 30 2011

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 12:54 EST 2016. Contains 278781 sequences.