Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122182
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122182 Least positive number k such that 2^k (mod k) == 2n, or 0 if no such k exists. +0
3
1, 3, 6, 10669, 9, 18, 3763, 1010, 20, 35, 2951, 42, 50, 27, 36, 49, 56, 110, 697, 578, 156, 540923, 70, 287, 104, 147, 4044, 970, 220, 59378, 119, 345, 66, 3007, 75, 1990362, 184, 190, 100, 115, 81, 162, 470, 406, 812, 6631, 105, 310, 160, 207, 322 (list; graph; listen)
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research