|
| |
|
|
A104124
|
|
a(n) = number of ways n = (2m-1)^2 *k, m >= k, k and m = positive integers.
|
|
0
| |
|
|
1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Sum{n=1 to infinity} a(n)/n = zeta(3)*7/4 + (1 - ln(2))*pi^2/4 - ln(4)
The first entries >1 are a(2601)=a(3249)=a(3969)=a(4761)=a(5625)=2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008
The first entries >2 are a(65025)=a(81225)=a(99225)=3. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008
|
|
|
EXAMPLE
| 1 = (2*1-1)^2*1
9 = (2*2-1)^2*1
18 = (2*2-1)^2*2
25 = (2*3-1)^2*1
49 = (2*4-1)^2*1
50 = (2*3-1)^2*2
75 = (2*3-1)^2*3
81 = (2*5-1)^2*1
98 = (2*4-1)^2*2
121 = (2*6-1)^2*1
147 = (2*4-1)^2*3
162 = (2*5-1)^2*2
169 = (2*7-1)^2*1
196 = (2*4-1)^2*4
225 = (2*8-1)^2*1
|
|
|
CROSSREFS
| Sequence in context: A126811 A014057 A015689 * A052434 A015241 A014025
Adjacent sequences: A104121 A104122 A104123 * A104125 A104126 A104127
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet, Mar 06 2005
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008
|
| |
|
|
