Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048259
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048259 Distinct solutions to x+y+z=0 mod n, where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z. +0
4
1, 1, 2, 3, 4, 3, 7, 4, 8, 6, 8, 4, 15, 5, 10, 11, 14, 5, 17, 6, 18, 14, 12, 6, 31, 9, 14, 13, 22, 7, 33, 8, 24, 16, 16, 16, 39, 9, 18, 19, 38, 9, 42, 10, 28, 29, 20, 10, 58, 15, 30, 22, 32, 11, 44, 20, 47, 25, 24, 12, 79, 13, 26, 36, 43, 23, 54, 14, 39, 27, 55, 14, 85 (list; graph; listen)
OFFSET

0,3

EXAMPLE

For n=6 the 7 solutions are xyz = 000 510 420 411 330 321 222.

CROSSREFS

Cf. A007997, A003050, A003051.

Sequence in context: A103634 A098596 A058267 this_sequence A102086 A009184 A009716

Adjacent sequences: A048256 A048257 A048258 this_sequence A048260 A048261 A048262

KEYWORD

nonn

AUTHOR

njas

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research