Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087671 Number of subsets S of {0,1,2,...,n-1} which are idempotent under squaring modulo n, where S*S mod n = {x*y mod n|x,y in S}. +0
1
2, 4, 6, 8, 8, 27, 10, 26, 18, 43, 10, 146, 14, 59, 107, 114, 12, 184, 14, 406, 142, 59 (list; graph; listen)
OFFSET

1,1

EXAMPLE

{4} is one of the a(6)=27 idempotent (mod 6) subsets of {0,1,2,3,4,5}, since {4}*{4}={16 mod 6}={4}.

CROSSREFS

Sequence in context: A060659 A063199 A062355 this_sequence A088308 A134488 A085492

Adjacent sequences: A087668 A087669 A087670 this_sequence A087672 A087673 A087674

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Sep 26 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research