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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
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; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..72.

EXAMPLE

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

CROSSREFS

Cf. A007997, A003050, A003051.

Sequence in context: A098596 A217536 A058267 * A324150 A198461 A228576

Adjacent sequences:  A048256 A048257 A048258 * A048260 A048261 A048262

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 19:44 EDT 2019. Contains 328128 sequences. (Running on oeis4.)