OFFSET
0,3
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..1000
FORMULA
a(2n) = a(2n-1) + Sum_{j=1..n} Fibonacci(j); a(2n+1) = a(2n) + 1 + Sum_{j=1..n} prime(j) for n >= 1. - Nathaniel Johnston, Jun 16 2011
MAPLE
A160794 := proc(n) option remember: if(n<=1)then return n: fi: if(n mod 2 = 0)then return procname(n-1)+add(combinat[fibonacci](j), j=1..n/2): fi: return procname(n-1)+add(ithprime(j), j=1..floor(n/2))+1: end: seq(A160794(n), n=0..46); # Nathaniel Johnston, Jun 16 2011
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Omar E. Pol, May 29 2009
EXTENSIONS
Terms after a(12) and edited by Nathaniel Johnston, Jun 16 2011
STATUS
approved