Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003560
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003560 Least number m such that 4^m = +- 1 mod 4n + 1. +0
1
1, 3, 3, 2, 3, 5, 7, 5, 9, 5, 6, 21, 13, 9, 15, 3, 11, 9, 15, 27, 4, 11, 5, 12, 25, 6, 9, 7, 6, 55, 25, 7, 9, 17, 23, 7, 37, 12, 13, 33, 10, 39, 43, 29, 45, 9, 9, 24, 49, 33, 5, 45, 35, 15, 12, 30, 19, 29, 39, 6 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Sequence in context: A031352 A057853 A129309 this_sequence A123676 A122775 A086632

Adjacent sequences: A003557 A003558 A003559 this_sequence A003561 A003562 A003563

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research