proposed

approved

editing

proposed

A036261 := proc(n, k) option remember ; if k = n then ithprime(n+1)-ithprime(n) ; else abs(procname(n, k+1)-procname(n-1, k)) ; end if; end proc: A173815 := proc(n) add(A036261(n, k), k=1..n) ; end proc: seq(A173815(n), n=1..90) ; [From _# _R. J. Mathar_, Mar 01 2010]

approved

editing

_Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), _, Feb 25 2010

A036261 := proc(n, k) option remember ; if k = n then ithprime(n+1)-ithprime(n) ; else abs(procname(n, k+1)-procname(n-1, k)) ; end if; end proc: A173815 := proc(n) add(A036261(n, k), k=1..n) ; end proc: seq(A173815(n), n=1..90) ; [From _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Mar 01 2010]

a(10), a(22) etc. corrected and sequence extended by _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Mar 01 2010

Sum of the numbers in the n-th row of Gilbreath's triangle (A036261).

1, 3, 3, 9, 7, 9, 7, 9, 11, 19, 17, 15, 9, 15, 13, 29, 23, 27, 33, 23, 29, 21, 31, 31, 35, 25, 27, 27, 41, 89, 57, 67, 51, 63, 49, 49, 49, 43, 39, 51, 39, 63, 47, 65, 45, 75, 95, 71, 67, 79, 59, 61, 59, 73, 61, 65, 77, 73, 75, 63, 95, 81, 87, 71, 103, 107, 85, 85, 101, 87, 71

1,2

A036261 := proc(n, k) option remember ; if k = n then ithprime(n+1)-ithprime(n) ; else abs(procname(n, k+1)-procname(n-1, k)) ; end if; end proc: A173815 := proc(n) add(A036261(n, k), k=1..n) ; end proc: seq(A173815(n), n=1..90) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 01 2010]

Cf. A036261, A036262.

nonn

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Feb 25 2010

a(10), a(22) etc. corrected and sequence extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 01 2010

approved