|
Search: id:A058212
|
|
| |
|
| 1, 0, 0, 1, 1, 2, 4, 5, 7, 10, 12, 15, 19, 22, 26, 31, 35, 40, 46, 51, 57, 64, 70, 77, 85, 92, 100, 109, 117, 126, 136, 145, 155, 166, 176, 187, 199, 210, 222, 235, 247, 260, 274, 287, 301, 316, 330, 345, 361, 376, 392, 409, 425, 442, 460, 477
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
For n >= 3, number of solutions to x+y+z=0 (mod n) with 0<=x<y<z<n. E.g. for n=3 there is a unique solution, x=0, y=1, z=2.
|
|
REFERENCES
|
S. A. Burr, B. Gr\"{u}nbaum and N. J. A. Sloane, The Orchard Problem, Geometriae Dedicata, 2 (1974), 397-424.
|
|
LINKS
|
S. A. Burr, B. Gr\"{u}nbaum and N. J. A. Sloane, The Orchard Problem, Geometriae Dedicata, 2 (1974), 397-424.
|
|
FORMULA
|
G.f.: (1-2x+x^2+x^4)/((1-x)^2(1-x^3)); a(n)=4cos(2*pi*n/3)/9+(3n^2-9n+10)/18. - Paul Barry (pbarry(AT)wit.ie), Mar 18 2004
|
|
CROSSREFS
|
Cf. A003035, A007997.
Apart from initial term, same as A007997.
The third diagonal of A061857 ?
Sequence in context: A047495 A005653 A092311 this_sequence A007997 A123120 A163267
Adjacent sequences: A058209 A058210 A058211 this_sequence A058213 A058214 A058215
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 30 2000
|
|
|
Search completed in 0.002 seconds
|
