login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087782 a(n) = number of solutions to x^3 + x == 0 (mod n). 0
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; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Cf. A087688, A000089.

Sequence in context: A030305 A084580 A171850 * A066099 A006375 A184441

Adjacent sequences:  A087779 A087780 A087781 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:09 EST 2012. Contains 205663 sequences.