EDITED A104732

[Alec Mihailovs]

----- Original Message ----- 
From: "Maximilian Hasler" <maximilian.hasler at gmail.com>
Sent: Saturday, April 26, 2008 10:57 PM

> %N A104732 Square array T[i,j]=T[i-1,j]+T[i-1,j-1], T[1,j]=j,
> T[i,1]=1; read by antidiagonals.

In this form, the generating function is

sum T[i,j] x^j y^i = xy/((1-(1+x)y)*(1-x)^2) 

Adding numbers by antidiagonals can be obtained by substituting y=x 
that gives the generating function for A001924 (multiplied by x).

Alec Mihailovs



DWW said:

dww> From seqfan-owner at ext.jussieu.fr  Mon Apr 14 15:13:15 2008
dww> From: "David W. Wilson" <wilson.d at anseri.com>
dww> To: <seqfan at ext.jussieu.fr>
dww> Subject: RE: Sum of prime rereciprocals?
dww> Date: Mon, 14 Apr 2008 09:08:31 -0400
dww> 
dww> Why not just sum of reciprocals, e.g:
dww> 
dww> a(n) = least k with sum(j = n..k; 1/j) >= 1.
dww> 
dww> It's an interesting sequence, which starts
dww> 
dww>    1,4,7,10,12,15,...

...

Neil