|
Search: id:A132188
|
|
|
| A132188 |
|
Number of 3-term geometric progressions with no term exceeding n. |
|
+0
2
|
|
| 1, 2, 3, 6, 7, 8, 9, 12, 17, 18, 19, 22, 23, 24, 25, 32
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also the number of 2 X 2 symmetric singular matrices with entries from {1, ..., n} - cf. A064368.
|
|
REFERENCES
|
Gerry Myerson, Trifectas in Geometric Progression, Australian Mathematical Society Gazette, 2008, to appear.
|
|
FORMULA
|
a(n) = Sum [sqrt(n/k)]^2, where the sum is over all squarefree k not exceeding n.
If we call A120486, this sequence and A132189 F(n), P(n) and S(n), respectively, then P(n) = 2 F(n) - n = S(n) + n. The Finch-Sebah paper cited at A000188 proves that F(n) is asymptotic to (3 / pi^2) n log n. In the reference, we prove that F(n) = (3 / pi^2) n log n + O(n), from which it follows that P(n) = (6 / pi^2) n log n + O(n) and similarly for S(n).
|
|
CROSSREFS
|
Sequence in context: A161824 A102806 A003605 this_sequence A060132 A059590 A144705
Adjacent sequences: A132185 A132186 A132187 this_sequence A132189 A132190 A132191
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Gerry Myerson (gerry(AT)ics.mq.edu.au), Nov 21 2007
|
|
|
Search completed in 0.002 seconds
|
