Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087782
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087782 a(n) = number of solutions to x^3 + x == 0 (mod n). +0
1
1, 2, 1, 1, 3, 2, 1, 1, 1, 6, 1, 1, 3, 2, 3, 1, 3, 2, 1, 3, 1, 2, 1, 1, 3, 6, 1, 1, 3, 6, 1, 1, 1, 6, 3, 1, 3, 2, 3, 3, 3, 2, 1, 1, 3, 2, 1, 1, 1, 6, 3, 3, 3, 2, 3, 1, 1, 6, 1, 3, 3, 2, 1, 1, 9, 2, 1, 3, 1, 6, 1, 1, 3, 6, 3, 1, 1, 6, 1, 3, 1, 6, 1, 1, 9, 2, 3, 1, 3, 6, 3, 1, 1, 2, 3, 1, 3, 2, 1, 3, 3, 6, 1, 3, 3 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A087688, A000089.

Sequence in context: A030321 A030305 A084580 this_sequence A066099 A006375 A164953

Adjacent sequences: A087779 A087780 A087781 this_sequence A087783 A087784 A087785

KEYWORD

mult,nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Oct 06 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 17 2005

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research