|
Search: id:A047522
|
|
|
| A047522 |
|
Numbers that are congruent to {1, 7} mod 8. |
|
+0
2
|
|
| 1, 7, 9, 15, 17, 23, 25, 31, 33, 39, 41, 47, 49, 55, 57, 63, 65, 71, 73, 79, 81, 87, 89, 95, 97, 103, 105, 111, 113, 119, 121, 127, 129, 135, 137, 143, 145, 151, 153, 159, 161, 167, 169, 175, 177, 183, 185, 191, 193, 199
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also n such that Kronecker(2,n)==mu(gcd(2,n)). - Jon Perry (perry(AT)globalnet.co.uk) and T. D. Noe (noe(AT)sspectra.com), Jun 13 2003
n such that x^2 == 2 (mod n) has a solution. The primes are given in sequence A001132. - T. D. Noe (noe(AT)sspectra.com), Jun 13 2003
As indicated in the formula, a(n) is related to the even triangular numbers. - Frederick Magata (frederick.magata(AT)t-online.de), Jun 17 2004
|
|
REFERENCES
|
L. B. W. Jolley, "Summation of Series", Dover Publications, p. 16.
|
|
FORMULA
|
a(n)=sqrt(8*A014494(n)+1)=sqrt(16*ceiling[n/2]*(2*n+1)+1)=sqrt(8*A056575(n)-8*(2n+1)*(-1)^n+1). - Frederick Magata (frederick.magata(AT)t-online.de), Jun 17 2004
1 - 1/7 + 1/9 - 1/15 + 1/17... = (Pi/8)*(1 + sqrt(2)). [Jolley] - Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 16 2006
|
|
MATHEMATICA
|
Select[Range[1, 191, 2], JacobiSymbol[2, # ]==1&]
|
|
CROSSREFS
|
Cf. A001132.
Cf. A014494, A056575.
Sequence in context: A116025 A020939 A073457 this_sequence A112072 A024902 A111312
Adjacent sequences: A047519 A047520 A047521 this_sequence A047523 A047524 A047525
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
