|
|
A102653
|
|
a(n) = 4 * floor(9*2^n/5).
|
|
3
|
|
|
4, 12, 28, 56, 112, 228, 460, 920, 1840, 3684, 7372, 14744, 29488, 58980, 117964, 235928, 471856, 943716, 1887436, 3774872, 7549744, 15099492, 30198988, 60397976, 120795952, 241591908, 483183820, 966367640, 1932735280, 3865470564, 7730941132, 15461882264
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
In binary, each term differs from the previous by a single bit.
|
|
LINKS
|
|
|
FORMULA
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|