A158301 -id:A158301 - cp's OEIS frontend

A122983 a(n) = (2 + (-1)^n + 3^n)/4.

1, 1, 3, 7, 21, 61, 183, 547, 1641, 4921, 14763, 44287, 132861, 398581, 1195743, 3587227, 10761681, 32285041, 96855123, 290565367, 871696101, 2615088301, 7845264903, 23535794707, 70607384121, 211822152361, 635466457083

Offset: 0

Paul Barry, Sep 22 2006

Old definition was: "Binomial transform of aeration of A081294".
Binomial transform is A063376.
A122983 = (1,1,3,7,1,1,3,7,...) mod 10. - M. F. Hasler, Feb 25 2008
Equals row sums of triangle A158301. - Gary W. Adamson, Mar 15 2009
a(n) = the number of ternary sequences of length n where the numbers of (0's, 1's) are both even. A015518 covers the (odd, even) and (even, odd) cases, and A081251 covers (odd, odd). - Toby Gottfried, Apr 18 2010
This sequence also describes the number of moves of the k-th disk solving (non-optimally) the [RED ; NEUTRAL ; BLUE] pre-colored Magnetic Tower of Hanoi (MToH) puzzle. The sequence A183119 is the partial sums of the sequence in question (obviously describing the total number of moves associated with the specific solution algorithm). For other MToH-related sequences, Cf. A183111 - A183125.
Let B=[1,sqrt(2),0; sqrt(2),1,sqrt(2); 0,sqrt(2),1] be a 3 X 3 matrix. Then a(n)=[B^n](1,1), n=0,1,2,.... - _L. Edson Jeffery, Dec 21 2011
Also the domination number of the n-Hanoi graph. - Eric W. Weisstein, Jun 16 2017
Also the matching number of the n-Sierpinski gasket graph. - Eric W. Weisstein, Jun 17 2017
Let M = [1,1,1,0; 1,1,0,1; 1,0,1,1; 0,1,1,1], a 4 X 4 matrix. Then a(n) is the upper left entry in M^n. - Philippe Deléham, Aug 23 2020
Also the lower matching number (=independent domination number) of the n-Hanoi graph. - Eric W. Weisstein, Aug 01 2023

M. F. Hasler, Table of n, a(n) for n = 0..199.
Ji Young Choi, A Generalization of Collatz Functions and Jacobsthal Numbers, J. Int. Seq., Vol. 21 (2018), Article 18.5.4.
Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, and Darleen Perez-Lavin, Peaks Sets of Classical Coxeter Groups, arXiv preprint, arXiv:1505.04479 [math.GR], 2015.
A. M. Hinz, S. Klavžar, U. Milutinović, and C. Petr, The Tower of Hanoi - Myths and Maths, Birkhäuser 2013. See page 99. Book's website
Uri Levy, The Magnetic Tower of Hanoi, arXiv:1003.0225 [math.CO], 2010.
Eric Weisstein's World of Mathematics, Domination Number.
Eric Weisstein's World of Mathematics, Hanoi Graph.
Eric Weisstein's World of Mathematics, Lower Independence Number.
Eric Weisstein's World of Mathematics, Matching Number.
Eric Weisstein's World of Mathematics, Sierpiński Gasket Graph.
Index entries for linear recurrences with constant coefficients, signature (3,1,-3).

Cf. a(j+1) = A137822(2^j) and these are the record values of A137822.

Cf. A054879 (bisection), A066443 (bisection). Row sums of A158303.

A122983 := n -> ceil(3^n/4); 'A122983(n)' $ n=0..22; # M. F. Hasler, Feb 25 2008
a[ -1]:=1:a[0]:=1:a[1]:=3:for n from 2 to 50 do a[n]:=2*a[n-1]+3*a[n-2]-2 od: seq(a[n], n=-1..25); # Zerinvary Lajos, Apr 28 2008

CoefficientList[Series[(1 - 2 x - x^2)/((1 - x) (1 + x) (1 - 3 x)), {x, 0, 40}], x] (* Harvey P. Dale, Sep 03 2013 *)
LinearRecurrence[{3, 1, -3}, {1, 1, 3}, 40] (* Harvey P. Dale, Sep 03 2013 *)
Table[(2 + (-1)^n + 3^n)/4, {n, 0, 20}] (* Eric W. Weisstein, Jun 16 2017 *)
Table[Floor[3^n/4] + 1, {n, 0, 20}] (* Eric W. Weisstein, Jan 17 2018 *)
Floor[3^Range[0, 20]/4] + 1 (* Eric W. Weisstein, Jan 17 2018 *)

A122983(n)=3^n\4+1 \\ M. F. Hasler, Feb 25 2008

def A122983(n): return (1 if n&1 else 3)+3**n>>2 # Chai Wah Wu, Apr 12 2023

From Paul Barry, Jun 14 2007: (Start)
G.f.: (1-2*x-x^2)/((1-x)*(1+x)*(1-3*x));
a(n) = 3^n/4+(-1)^n/4+1/2;
E.g.f.: cosh(x)^2*exp(x). (End)
a(n) = 3*a(n-1) + a(n-2) - 3*a(n-3); a(0)=1, a(1)=1, a(2)=3. - Harvey P. Dale, Sep 03 2013
E.g.f.: Q(0)/2, where Q(k) = 1 + 3^k/( 2 - 2*(-1)^k/( 3^k + (-1)^k - 2*x*3^k/( 2*x + (k+1)*(-1)^k/Q(k+1) ))); (continued fraction). - Sergei N. Gladkovskii, Dec 22 2013
a(2*n) = 3*a(2*n-1); a(2*n+1) = 3*a(2*n) - 2. - Philippe Deléham, Aug 23 2020

Extended and corrected (existing Maple code) by M. F. Hasler, Feb 25 2008

Description changed to formula by Eric W. Weisstein, Jun 16 2017

A158302 "1" followed by repeats of 2^k deleting all 4^k, k>0.

Original entry on oeis.org

1, 2, 2, 8, 8, 32, 32, 128, 128, 512, 512, 2048, 2048, 8192, 8192, 32768, 32768, 131072, 131072, 524288, 524288, 2097152, 2097152, 8388608, 8388608, 33554432, 33554432, 134217728, 134217728, 536870912, 536870912, 2147483648, 2147483648, 8589934592

Offset: 0

Gary W. Adamson, Mar 15 2009

Binomial transform = A122983: (1, 3, 7, 21, 61, 183,...). Equals right border of triangle A158301.
Also the order of the graph automorphism group of the n+1 X n+1 black bishop graph. - Eric W. Weisstein, Jun 27 2017
For n > 1, also the order of the graph automorphism group of the n X n white bishop graph. - Eric W. Weisstein, Jun 27 2017

			Given "1" followed by repeats of powers of 2: (1, 2, 2, 4, 4, 8, 8, 16, 16,...);
delete powers of 4: (4, 16, 64, 156,...) leaving A158300:
(1, 2, 2, 8, 8, 32, 32, 128, 128,...).

Eric Weisstein's World of Mathematics, Black Bishop Graph
Eric Weisstein's World of Mathematics, Graph Automorphism
Eric Weisstein's World of Mathematics, White Bishop Graph
Index entries for linear recurrences with constant coefficients, signature (0, 4).

Cf. A122983, A158301, A154388

1,seq(4^floor((n+1)/2)/2, n=1..33); # Peter Luschny, Jul 02 2020

Join[{1}, Flatten[Table[{2^n, 2^n}, {n, 1, 41, 2}]]] (* Harvey P. Dale, Jan 24 2013 *)
Join[{1}, Table[2^(2 Ceiling[n/2] - 1), {n, 20}]] (* Eric W. Weisstein, Jun 27 2017 *)
Join[{1}, 2^(2 Ceiling[Range[20]/2] - 1)] (* Eric W. Weisstein, Jun 27 2017 *)

1 followed by repeats of powers of 2, deleting powers of 4: (4, 16, 64,...). Inverse binomial transform of A122983 starting (1, 3, 7, 21, 61, 183,...).
For n > 3: a(n) = a(n-1)*a(n-2)/a(n-3). [Reinhard Zumkeller, Mar 06 2011]
For n > 3: a(n) = 4a(n-2). [Charles R Greathouse IV, Feb 06 2011]
a(n) = Sum_{k, 0<=k<=n} A154388(n,k)*2^k. - Philippe Deléham, Dec 17 2011
G.f.: (1+2*x-2*x^2)/(1-4*x^2). - Philippe Deléham, Dec 17 2011

More terms from Harvey P. Dale, Jan 24 2013

cp's OEIS Frontend

A122983 a(n) = (2 + (-1)^n + 3^n)/4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

Extensions

A158302 "1" followed by repeats of 2^k deleting all 4^k, k>0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A158300 Numerator of Bernoulli(n, -5/6).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica