Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A155886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A155886 Least k such that 2^(2^k) = n (mod k). +0
2
1, 3, 14, 11, 6, 1941491, 10, 83, 31, 13, 123, 35, 71, 27, 34913, 241, 18, 8059, 34, 349, 44, 25, 39, 100867561, 76, 231, 253, 66203, 57, 227, 139, 45, 184, 37, 111, 97, 55, 41, 103, 1099, 81, 66791, 53 (list; graph; listen)
OFFSET

0,2

COMMENT

First occurrence of n in sequence A155836.

CROSSREFS

A015910 (2^n mod n), A036236

Sequence in context: A058991 A090786 A127818 this_sequence A138959 A055435 A070418

Adjacent sequences: A155883 A155884 A155885 this_sequence A155887 A155888 A155889

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jan 29 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research