OFFSET
1,3
MAPLE
A000045 := proc(n) option remember ; combinat[fibonacci](n) ; end: A004001 := proc(n) option remember ; if n <= 0 then 0 ; elif n <= 2 then 1; else A004001(A004001(n-1))+A004001(n-A004001(n-1)) ; fi ; end: A120475 := proc(n) add( A000045(m)*(A004001(m+1)-2*A004001(m)+A004001(m-1)), m=1..n) ; end: seq(A120475(n), n=1..80) ; # R. J. Mathar, Sep 18 2007
MATHEMATICA
Conway[0] = 0; Conway[1] = Conway[2] = 1; Conway[n_Integer?Positive] := Conway[n] = Conway[Conway[n - 1]] + Conway[n - Conway[n - 1]]; a[n_] := Fibonacci[n]*(Conway[n + 1] - 2*Conway[n] + Conway[n - 1]); Table[Sum[a[m], {m, 1, n}], {n, 1, 30}]
CROSSREFS
KEYWORD
sign
AUTHOR
Roger L. Bagula, Jul 07 2006
EXTENSIONS
Edited by N. J. A. Sloane, Aug 14 2006
More terms from R. J. Mathar, Sep 18 2007
STATUS
approved