# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a112027
Showing 1-1 of 1

%I A112027 #22 May 20 2024 10:29:07
%S A112027 1,2,1,3,7,8,4,6,25,26,13,15,79,80,40,42,241,242,121,123,727,728,364,
%T A112027 366,2185,2186,1093,1095,6559,6560,3280,3282,19681,19682,9841,9843,
%U A112027 59047,59048,29524,29526,177145,177146,88573,88575,531439,531440,265720,265722,1594321
%N A112027 a(1)=1; then successively add 1, divide by 2, add 2 and then total up the last 4 terms.
%D A112027 Joshua Zucker, Posting to Seq Fan mailing list, Nov 24 2005
%H A112027 Paolo Xausa, <a href="/A112027/b112027.txt">Table of n, a(n) for n = 1..5000</a>
%H A112027 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,4,0,0,0,-3).
%F A112027 G.f.: -x*(6*x^7-3*x^4-3*x^3-x^2-2*x-1) / ((x-1)*(x+1)*(x^2+1)*(3*x^4-1)). - _Colin Barker_, Jul 28 2013
%p A112027 a[1]:=1; k:=1; for n from 1 to 16 do k:=k+1; a[k]:=a[k-1]+1; k:=k+1; a[k]:=a[k-1]/2; k:=k+1; a[k]:=a[k-1]+2; k:=k+1; a[k]:=a[k-1]+a[k-2]+a[k-3]+a[k-4]; od;
%t A112027 LinearRecurrence[{0, 0, 0, 4, 0, 0, 0, -3}, {1, 2, 1, 3, 7, 8, 4, 6}, 50] (* _Paolo Xausa_, May 20 2024 *)
%Y A112027 Quadrusections: A058481, A024023, A003462, A067771.
%K A112027 nonn,easy
%O A112027 1,2
%A A112027 _N. J. A. Sloane_, Nov 24 2005
%E A112027 Definition found by _Franklin T. Adams-Watters_, Feb 01 2006
%E A112027 More terms from _N. J. A. Sloane_, Feb 22 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE