|
Search: id:A061780
|
|
|
| A061780 |
|
Number of solutions to x+y+z = 0 mod (2n+1) such that x,y,z are units modulo 2n+1 i.e. gcd(x,2n+1) = gcd(y,2n+1) = gcd(z,2n+1) = 1. |
|
+0
1
|
|
| 2, 12, 30, 18, 90, 132, 24, 240, 306, 60, 462, 300, 162, 756, 870, 180, 360, 1260, 264, 1560, 1722, 216, 2070, 1470, 480, 2652, 1080, 612, 3306, 3540, 540, 1584, 4290, 924, 4830, 5112, 600, 2700, 6006, 1458, 6642, 2880, 1512, 7656, 3960, 1740, 3672, 9120
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) is multiplicative and if 2n+1=p^k is a prime power with p an odd prime then a(n) = p^(2k-2) * (p^2 - 3p + 2).
|
|
EXAMPLE
|
The only solutions modulo 3 in units are 1+1+1 = 0 mod 3, 2+2+2 = 0 mod 3 so the first element of the sequence is 2.
|
|
CROSSREFS
|
Adjacent sequences: A061777 A061778 A061779 this_sequence A061781 A061782 A061783
Sequence in context: A102960 A119201 A034318 this_sequence A067348 A002939 A118239
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Ahmed Fares (ahmedfares(AT)my-deja.com), Jun 22 2001
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 23 2001
|
|
|
Search completed in 0.002 seconds
|
