|
Search: id:A062207
|
|
|
| A062207 |
|
a(n) = m such that Sum_{i = 1..m } 2*i-1 = n^(2*n) (A062206). |
|
+0
3
|
|
| 1, 7, 53, 511, 6249, 93311, 1647085, 33554431, 774840977, 19999999999, 570623341221, 17832200896511, 605750213184505, 22224013651116031, 875787780761718749, 36893488147419103231, 1654480523772673528353
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
"By setting n=m^p, one sees that m^(2p), an even power of any integer, is equal to the sum of all the odd integers up to and including 2m^p-1;..." - p. 16.
|
|
REFERENCES
|
C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory, Oxford University Press, 1966, pp. 16-17.
|
|
FORMULA
|
a(n) = (2*(n^n)-1).
a(n)=A013499(n)-1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 18 2007
|
|
EXAMPLE
|
a(2)=7 and 1+3+5+7=16, which is A062206(2). a(3)=53 and 1+3+5+...+53=729, which is A062206(3).
|
|
CROSSREFS
|
Cf. A062206.
Sequence in context: A057180 A137612 A092802 this_sequence A116202 A081008 A116472
Adjacent sequences: A062204 A062205 A062206 this_sequence A062208 A062209 A062210
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jun 13 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jun 15 2001
|
|
|
Search completed in 0.002 seconds
|
