Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Nov 17 2013 15:03:03
%S 0,1,4,10,34,94,298,862,2650,7822,23722,70654,212986,636910,1914826,
%T 5736286,17225242,51642958,154994410,464852158,1394818618,4183931566,
%U 12552843274,37656432670,112973492314,338912088334,1016753042218
%N Inverse binomial transform of (0 followed by A037481).
%F a(n)= (-1)^n*A091003(n), n>0.
%F a(n+1)-3*a(n) = (-1)^(n+1)*A000079(n-1), n>0.
%F |a(n+1)-3*a(n)| = A011782(n).
%F O.g.f.: (1+3x)x/((1+2x)(1-3x)). a(n)=((-2)^n+4*3^n)/10, n>0. - _R. J. Mathar_, Jul 14 2008
%F a(n) = a(n-1)+6*a(n-2) for n>2, a(0)=0, a(1)=1, a(2)=4. - _Philippe Deléham_, Nov 17 2013
%F a(n) + a(n+1) = A140796(n). - _Philippe Deléham_, Nov 17 2013
%F a(n+1) = sum_{k=0..n} A108561(n,k)*(-3)^k. - _Philippe Deléham_, Nov 17 2013
%Y Cf. A083421 (bin. transform of (0 followed by A037481)).
%K nonn
%O 0,3
%A _Paul Curtz_, Jul 12 2008
%E Edited and extended by _R. J. Mathar_, Jul 14 2008