OFFSET
0,1
COMMENTS
In binary, each term differs from the previous by a single bit.
LINKS
Index entries for linear recurrences with constant coefficients, signature (3,-3,3,-2).
FORMULA
From R. J. Mathar, Feb 20 2011: (Start)
a(n) = 4 * A151754(n+1).
G.f.: 4 * ( 1+x^2-x^3 ) / ( (x-1)*(2*x-1)*(x^2+1) ). (End)
a(0)=4, a(1)=12, a(2)=28, a(3)=56, a(n) = 3*a(n-1)-3*a(n-2)+3*a(n-3)-2*a(n-4). - Harvey P. Dale, Jun 15 2011
MATHEMATICA
Table[4Floor[(27 2^n)/15], {n, 0, 30}] (* or *) LinearRecurrence[ {3, -3, 3, -2}, {4, 12, 28, 56}, 30] (* Harvey P. Dale, Jun 15 2011 *)
PROG
(PARI) a(n)=27<<n\15*4 \\ Charles R Greathouse IV, Feb 04 2016
CROSSREFS
KEYWORD
easy,nonn,less
AUTHOR
Odimar Fabeny, Feb 02 2005
EXTENSIONS
Edited by Don Reble, Mar 28 2006
STATUS
approved