Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081755
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081755 Number of noncongruent solutions to x^(2^m) == 1 (mod n) when n is such that the number of solutions is the same for any m>=1. +0
1
1, 1, 2, 2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 4, 2, 2, 8, 2, 4, 2, 4, 4, 2, 4, 2, 4, 2, 2, 2, 2, 8, 4, 2, 2, 4, 4, 2, 4, 2, 8, 4, 4, 2, 2, 2, 8, 2, 8, 4, 4, 2, 2, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 4, 2, 8, 4, 2, 4, 2, 4, 2, 4, 2, 8, 4, 2, 4, 2 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A060594.

Sequence in context: A127973 A023157 A069733 this_sequence A097859 A028326 A048003

Adjacent sequences: A081752 A081753 A081754 this_sequence A081756 A081757 A081758

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 08 2003

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research