OFFSET

0,3

COMMENTS

Normally sequences like this are not included, since with the alternating 0's deleted it is already in the database.

Inverse binomial transform of A001333. - Paul Barry, Feb 25 2003

"Sloping binary representation" of powers of 2 (A000079), slope=-1 (see A037095 and A102370). - Philippe Deléham, Jan 04 2008

0,1,0,2,0,4,0,8,0,16,... is the inverse binomial transform of A000129 (Pell numbers). - Philippe Deléham, Oct 28 2008

Number of maximal self-avoiding walks from the NW to SW corners of a 3 X n grid.

Row sums of the triangle in A204293. - Reinhard Zumkeller, Jan 14 2012

Pisano period lengths: 1, 1, 4, 1, 8, 4, 6, 1, 12, 8, 20, 4, 24, 6, 8, 1, 16, 12, 36, 8, ... . - R. J. Mathar, Aug 10 2012

This sequence occurs in the length L(n) = sqrt(2)^n of Lévy's C-curve at the n-th iteration step. Therefore, L(n) is the Q(sqrt(2)) integer a(n) + a(n-1)*sqrt(2), with a(-1) = 0. For a variant of this C-curve see A251732 and A251733. - Wolfdieter Lang, Dec 08 2014

a(n) counts walks (closed) on the graph G(1-vertex,2-loop,2-loop). Equivalently the middle entry (2,2) of A^n where the adjacency matrix of digraph is A=(0,1,0;1,0,1;0,1,0). - David Neil McGrath, Dec 19 2014

a(n-2) is the number of compositions of n into even parts. For example, there are 4 compositions of 6 into even parts: (6), (222), (42), and (24). - David Neil McGrath, Dec 19 2014

Also the number of alternately constant compositions of n + 2, ranked by A351010. The alternately strict version gives A000213. The unordered version is A035363, ranked by A000290, strict A035457. - Gus Wiseman, Feb 19 2022

a(n) counts degree n fixed points of GF(2)[x]'s automorphisms. Proof: given a field k, k[x]'s automorphisms are determined by k's automorphisms and invertible affine maps x -> ax + b. GF(2) is rigid and has only one unit so its only nontrivial automorphism is x -> x + 1. For n = 0 we have 1 fixed point, the constant polynomial 1. (Taking the convention that 0 is not a degree 0 polynomial.) For n = 1 we have 0 fixed points as x -> x + 1 -> x are the only degree 1 polynomials. Note that if f(x) is a fixed point, then f(x) + 1 is also a fixed point. Given f(x) a degree n fixed point, we can assume WLOG x | f(x). Applying the automorphism, we then have x + 1 | f(x). Now note that f(x) / (x^2 + x) must be a fixed point, so any fixed point of degree n must either be of the form g(x) * (x^2 + x) or g(x) * (x^2 + x) + 1 for a unique degree n - 2 fixed point g(x). Therefore we have the recurrence relation a(n) = 2 * a(n - 2) as desired. - Keith J. Bauer, Mar 19 2024

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (0,2).

FORMULA

G.f.: 1/(1-2*x^2).

E.g.f.: cosh(x*sqrt(2)).

a(n) = (1 - n mod 2) * 2^floor(n/2).

a(n) = sqrt(2)^n*(1+(-1)^n)/2. - Paul Barry, May 13 2003

a(n) = 2*a(n-2) with a(0)=1, a(1)=0. - Jim Singh, Jul 12 2018

MAPLE

seq(op([2^n, 0]), n=0..100); # Robert Israel, Dec 23 2014

MATHEMATICA

a077957[n_] := Riffle[Table[2^i, {i, 0, n - 1}], Table[0, {n}]]; a077957[29] (* Michael De Vlieger, Dec 22 2014 *)

CoefficientList[Series[1/(1 - 2*x^2), {x, 0, 50}], x] (* G. C. Greubel, Apr 12 2017 *)

LinearRecurrence[{0, 2}, {1, 0}, 54] (* Robert G. Wilson v, Jul 23 2018 *)

Riffle[2^Range[0, 30], 0, {2, -1, 2}] (* Harvey P. Dale, Jan 06 2022 *)

PROG

(PARI) a(n)=if(n<0||n%2, 0, 2^(n/2))

(Haskell)

a077957 = sum . a204293_row -- Reinhard Zumkeller, Jan 14 2012

(Sage)

def A077957():

x, y = -1, 1

while True:

yield -x

x, y = x + y, x - y

a = A077957(); [next(a) for i in range(40)] # Peter Luschny, Jul 11 2013

(Magma) &cat [[2^n, 0]: n in [0..20]]; // Vincenzo Librandi, Apr 03 2018

(GAP) Flat(List([0..30], n->[2^n, 0])); # Muniru A Asiru, Aug 05 2018

CROSSREFS

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Nov 17 2002

STATUS

approved