A080926 -id:A080926 - cp's OEIS frontend

A015518 a(n) = 2a(n-1) + 3a(n-2), with a(0)=0, a(1)=1.

0, 1, 2, 7, 20, 61, 182, 547, 1640, 4921, 14762, 44287, 132860, 398581, 1195742, 3587227, 10761680, 32285041, 96855122, 290565367, 871696100, 2615088301, 7845264902, 23535794707, 70607384120, 211822152361, 635466457082

Offset: 0

Olivier Gérard

Number of walks of length n between any two distinct vertices of the complete graph K_4. - Paul Barry and Emeric Deutsch, Apr 01 2004
For n >= 1, a(n) is the number of integers k, 1 <= k <= 3^(n-1), whose ternary representation ends in an even number of zeros (see A007417). - Philippe Deléham, Mar 31 2004
Form the digraph with matrix A=[0,1,1,1;1,0,1,1;1,1,0,1;1,0,1,1]. A015518(n) corresponds to the (1,3) term of A^n. - Paul Barry, Oct 02 2004
The same sequence may be obtained by the following process. Starting a priori with the fraction 1/1, the denominators of fractions built according to the rule: add top and bottom to get the new bottom, add top and 4 times the bottom to get the new top. The limit of the sequence of fractions is 2. - Cino Hilliard, Sep 25 2005
(A046717(n))^2 + (2*a(n))^2 = A046717(2n). E.g., A046717(3) = 13, 2*a(3) = 14, A046717(6) = 365. 13^2 + 14^2 = 365. - Gary W. Adamson, Jun 17 2006
For n >= 2, number of ordered partitions of n-1 into parts of sizes 1 and 2 where there are two types of 1 (singletons) and three types of 2 (twins). For example, the number of possible configurations of families of n-1 male (M) and female (F) offspring considering only single births and twins, where the birth order of M/F/pair-of-twins is considered and there are three types of twins; namely, both F, both M, or one F and one M - where birth order within a pair of twins itself is disregarded. In particular, for a(3)=7, two children could be either: (1) F, then M; (2) M, then F; (3) F,F; (4) M,M; (5) F,F twins; (6) M,M twins; or (7) M,F twins (emphasizing that birth order is irrelevant here when both/all children are the same gender and when two children are within the same pair of twins). - Rick L. Shepherd, Sep 18 2004
a(n) is prime for n = {2, 3, 5, 7, 13, 23, 43, 281, 359, ...}, where only a(2) = 2 corresponds to a prime of the form (3^k - 1)/4. All prime terms, except a(2) = 2, are the primes of the form (3^k + 1)/4. Numbers k such that (3^k + 1)/4 is prime are listed in A007658. Note that all prime terms have prime indices. Prime terms are listed in A111010. - Alexander Adamchuk, Nov 19 2006
Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=-2, A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n>=1, a(n)=charpoly(A,1). - Milan Janjic, Jan 26 2010
Select an odd size subset S from {1,2,...,n}, then select an even size subset from S. - Geoffrey Critzer, Mar 02 2010
a(n) is the number of ternary sequences of length n where the numbers of (0's, 1's) are (even, odd) respectively, and, by symmetry, the number of such sequences where those numbers are (odd, even) respectively. A122983 covers (even, even), and A081251 covers (odd, odd). - Toby Gottfried, Apr 18 2010
An elephant sequence, see A175654. For the corner squares just one A[5] vector, with decimal value 341, leads to this sequence (without the leading 0). For the central square this vector leads to the companion sequence A046717 (without the first leading 1). - Johannes W. Meijer, Aug 15 2010
Let R be the commutative algebra resulting from adjoining the elements of the Klein four-group to the integers (equivalently, K = Z[x,y,z]/{x*y - z, y*z - x, x*z - y, x^2 - 1, y^2 - 1, z^2 - 1}). Then a(n) is equal to the coefficients of x, y, and z in the expansion of (x + y + z)^n. - Joseph E. Cooper III (easonrevant(AT)gmail.com), Nov 06 2010
Pisano period lengths:  1, 2, 2, 4, 4, 2, 6, 8, 2, 4, 10, 4, 6, 6, 4, 16, 16, 2, 18, 4, ... - R. J. Mathar, Aug 10 2012
The ratio a(n+1)/a(n) converges to 3 as n approaches infinity. - Felix P. Muga II, Mar 09 2014
This is a divisibility sequence, also the values of Chebyshev polynomials, and also the number of ways of packing a 2 X n-1 rectangle with dominoes and unit squares. - R. K. Guy, Dec 16 2016
For n>0, gcd(a(n),a(n+1))=1. - Kengbo Lu, Jul 02 2020

John Derbyshire, Prime Obsession, Joseph Henry Press, April 2004, see p. 16.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
A. Abdurrahman, CM Method and Expansion of Numbers, arXiv:1909.10889 [math.NT], 2019.
Jean-Paul Allouche, Jeffrey Shallit, Zhixiong Wen, Wen Wu, and Jiemeng Zhang, Sum-free sets generated by the period-k-folding sequences and some Sturmian sequences, arXiv:1911.01687 [math.CO], 2019.
Katerina Böhmová, Cristina Dalfó, and Clemens Huemer, On cyclic Kautz digraphs, Research Report, 2015.
Garry Bowlin and Matthew G. Brin, Coloring Planar Graphs via Colored Paths in the Associahedra, arXiv preprint arXiv:1301.3984 [math.CO], 2013. - From _N. J. A. Sloane_, Feb 12 2013
AJ Bu and Doron Zeilberger, Using Symbolic Computation to Explore Generalized Dyck Paths and Their Areas, arXiv:2305.09030 [math.CO], 2023.
Ji Young Choi, A Generalization of Collatz Functions and Jacobsthal Numbers, J. Int. Seq., Vol. 21 (2018), Article 18.5.4.
Sergio Falcón, Binomial Transform of the Generalized k-Fibonacci Numbers, Communications in Mathematics and Applications (2019) Vol. 10, No. 3, 643-651.
Dale Gerdemann, Fractal generated from (2,3) recursion, YouTube Video, Dec 05 2014.
Toufik Mansour and Mark Shattuck, Pattern avoidance in flattened derangements, Disc. Math. Lett. (2025) Vol. 15, 67-74. See p. 74.
R. J. Mathar, Counting Walks on Finite Graphs, Nov 2020, Section 2.
Felix Pozon Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, March 2014.
Index entries for linear recurrences with constant coefficients, signature (2,3).
Index entries for sequences related to Chebyshev polynomials.

a(n) = A080926(n-1) + 1 = (1/3)*A054878(n+1) = (1/3)*abs(A084567(n+1)).
First differences of A033113 and A039300.
Partial sums of A046717.
The following sequences (and others) belong to the same family: A000129, A001333, A002532, A002533, A002605, A015518, A015519, A026150, A046717, A063727, A083098, A083099, A083100, A084057.
Cf. A046717.
Cf. A007658, A111010.
Cf. A001045, A078008, A097073, A115341. - Vladimir Joseph Stephan Orlovsky, Dec 11 2008
Cf. A007482, A059260.

[Round(3^n/4): n in [0..30]]; // Vincenzo Librandi, Jun 24 2011

Table[(3^n-(-1)^n)/4,{n,0,30}] (* Alexander Adamchuk, Nov 19 2006 *)

a(n):= round(3^n/4)$ /* Dimitri Papadopoulos, Nov 28 2023 */

PARI
```
a(n)=round(3^n/4)
```

for n in range(0, 20): print(int((3**n-(-1)**n)/4), end=', ') # Stefano Spezia, Nov 30 2018

Sage
```
[round(3^n/4) for n in range(0,27)]
```

G.f.: x/((1+x)*(1-3*x)).
a(n) = (3^n - (-1)^n)/4 = floor(3^n/4 + 1/2).
a(n) = 3^(n-1) - a(n-1). - Emeric Deutsch, Apr 01 2004
E.g.f.: (exp(3*x) - exp(-x))/4. Second inverse binomial transform of (5^n-1)/4, A003463. Inverse binomial transform for powers of 4, A000302 (when preceded by 0). - Paul Barry, Mar 28 2003
a(n) = Sum_{k=0..floor(n/2)} C(n, 2k+1)*2^(2k). - Paul Barry, May 14 2003
a(n) = Sum_{k=1..n} binomial(n, k)*(-1)^(n+k)*4^(k-1). - Paul Barry, Apr 02 2003
a(n+1) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*2^(n-2*k)*3^k. - Paul Barry, Jul 13 2004
a(n) = U(n-1, i/sqrt(3))(-i*sqrt(3))^(n-1), i^2=-1. - Paul Barry, Nov 17 2003
G.f.: x*(1+x)^2/(1 - 6*x^2 - 8*x^3 - 3*x^4) = x(1+x)^2/characteristic polynomial(x^4*adj(K_4)(1/x)). - Paul Barry, Feb 03 2004
a(n) = sum_{k=0..3^(n-1)} A014578(k) = -(-1)^n*A014983(n) = A051068(3^(n-1)), for n > 0. - Philippe Deléham, Mar 31 2004
E.g.f.: exp(x)*sinh(2*x)/2. - Paul Barry, Oct 02 2004
a(2*n+1) = A054880(n) + 1. - M. F. Hasler, Mar 20 2008
2*a(n) + (-1)^n = A046717(n). - M. F. Hasler, Mar 20 2008
a(n) = ((1+sqrt(4))^n - (1-sqrt(4))^n)/4. - Al Hakanson (hawkuu(AT)gmail.com), Dec 31 2008
a(n) = abs(A014983(n)). - Zerinvary Lajos, May 28 2009
a(n) = round(3^n/4). - Mircea Merca, Dec 28 2010
a(n) = Sum_{k=1,3,5,...} binomial(n,k)*2^(k-1). - Geoffrey Critzer, Mar 02 2010
From Sergei N. Gladkovskii, Jul 19 2012: (Start)
G.f.: G(0)/4 where G(k)= 1 - 1/(9^k - 3*x*81^k/(3*x*9^k - 1/(1 + 1/(3*9^k - 27*x*81^k/(9*x*9^k + 1/G(k+1)))))); (continued fraction).
E.g.f.: G(0)/4 where G(k)= 1 - 1/(9^k - 3*x*81^k/(3*x*9^k - (2*k+1)/(1 + 1/(3*9^k - 27*x*81^k/(9*x*9^k + (2*k+2)/G(k+1)))))); (continued fraction).  (End)
G.f.: G(0)*x/(2*(1-x)), where G(k) = 1 + 1/(1 - x*(4*k-1)/(x*(4*k+3) - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 26 2013
a(n+1) = Sum_{k = 0..n} A238801(n,k)*2^k. - Philippe Deléham, Mar 07 2014
a(n) = (-1)^(n-1)*Sum_{k=0..n-1} A135278(n-1,k)*(-4)^k = (-1)^(n-1)*Sum_{k=0..n-1} (-3)^k. Equals (-1)^(n-1)*Phi(n,-3), where Phi is the cyclotomic polynomial when n is an odd prime. (For n > 0.) - Tom Copeland, Apr 14 2014
a(n) = 2*A006342(n-1) - n mod 2 if n > 0, a(0)=0. - Yuchun Ji, Nov 30 2018
a(n) = 2*A033113(n-2) + n mod 2 if n > 0, a(0)=0. - Yuchun Ji, Aug 16 2019
a(2*k) = 2*A002452(k), a(2*k+1) = A066443(k). - Yuchun Ji, Aug 14 2019
a(n+1) = 2*Sum_{k=0..n} a(k) if n odd, and 1 + 2*Sum_{k=0..n} a(k) if n even. - Kengbo Lu, May 30 2020
a(n) = F(n) + Sum_{k=1..(n-1)} a(k)*L(n-k), for F(n) and L(n) the Fibonacci and Lucas numbers. - Kengbo Lu and Greg Dresden, Jun 05 2020
From Kengbo Lu, Jun 11 2020: (Start)
a(n) = A002605(n) + Sum_{k = 1..n-2} a(k)*A002605(n-k-1).
a(n) = A006130(n-1) + Sum_{k = 1..n-1} a(k)*A006130(n-k-1). (End)
a(2n) = Sum_{i>=0, j>=0} binomial(n-j-1,i)*binomial(n-i-1,j)* 2^(2n-2i-2j-1)* 3^(i+j). - Kengbo Lu, Jul 02 2020
a(n) = 3*a(n-1) - (-1)^n. - Dimitri Papadopoulos, Nov 28 2023
G.f.: x/((1 + x)*(1 - 3*x)) = Sum_{n >= 0} x^(n+1) * Product_{k = 1..n} (k + 3*x + 1)(1 + k*x) (a telescoping series). Cf. A007482. - Peter Bala, May 08 2024
From Peter Bala, Jun 29 2025: (Start)
For n >= 1, a(n+1) = 2^n * hypergeom([1/2 - (1/2)*n, -(1/2)*n], [-n], -3).
G.f. A(x) = x*exp(Sum_{n >= 1} a(2*n)/a(n)*x^n/n) =  x + 2*x^2 + 7*x^3 + 20*x^4 + ....
sqrt(A(x)/x) is the g.f. of A002426.
The following series telescope:
Sum_{n >= 1} (-3)^n/(a(n)*a(n+1)) = -1; Sum_{n >= 1} (-3)^n/(a(n)*a(n+1)*a(n+2)*a(n+3)) = -1/98.
In general, for k >= 0, Sum_{n >= 1} (-3)^n/(a(n)*a(n+1)*...*a(n+2*k+1)) = -1/((a(1)*a(2)*...*a(2*k+1))*a(2*k+1)).
Sum_{n >= 1} 3^n/(a(n)*a(n+1)*a(n+2)) = 1/4; Sum_{n >= 1} 3^n/(a(n)*a(n+1)*a(n+2)* a(n+3)*a(n+4)) = 1/5600.
In general, for k >= 1, Sum_{n >= 1} 3^n/(a(n)*a(n+1)*...*a(n+2*k)) = 1/((a(1)*a(2)*...*a(2*k))*a(2*k)). (End)

More terms from Emeric Deutsch, Apr 01 2004

Edited by Ralf Stephan, Aug 30 2004

A080924 Jacobsthal gap sequence.

Original entry on oeis.org

0, 1, 3, 1, 15, 1, 63, 1, 255, 1, 1023, 1, 4095, 1, 16383, 1, 65535, 1, 262143, 1, 1048575, 1, 4194303, 1, 16777215, 1, 67108863, 1, 268435455, 1, 1073741823, 1, 4294967295, 1, 17179869183, 1, 68719476735, 1, 274877906943, 1, 1099511627775, 1

Offset: 0

Paul Barry, Feb 26 2003

Inverse binomial transform of A080925
From Peter Bala, Dec 26 2012: (Start)
Let F(x) = product {n >= 0} (1 - x^(3*n+1))/(1 - x^(3*n+2)). This sequence is the simple continued fraction expansion of the real number F(1/4) = 0.79761 68651 30459 16010 ... = 1/(1 + 1/(3 + 1/(1 + 1/(15 + 1/(1 + 1/(63 + 1/(1 + 1/(255 + ...)))))))). See A111317. (End)
Also, the decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 3", based on the 5-celled von Neumann neighborhood, initialized with a single black (ON) cell at stage zero. - Robert Price, Apr 19 2017

S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.

Vincenzo Librandi, Table of n, a(n) for n = 0..300
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
S. Wolfram, A New Kind of Science
Wolfram Research, Wolfram Atlas of Simple Programs
Index entries for sequences related to cellular automata
Index to 2D 5-Neighbor Cellular Automata
Index to Elementary Cellular Automata
Index entries for linear recurrences with constant coefficients, signature (-1,4,4).

Cf. A001045, A002450, A080926, A080927, A111317.

CoefficientList[Series[x (1 + 4 x) / ((1 + x) (1 + 2 x) (1 - 2 x)), {x, 0, 50}], x] (* Vincenzo Librandi, Aug 05 2013 *)
LinearRecurrence[{-1, 4, 4}, {0, 1, 3}, 42] (* Jean-François Alcover, Sep 21 2017 *)

a(2n) = 3*A001045(2n) = 3*A002450(n) = 4^n-1, a(2n+1)=1.
a(n) = (2^n-2*(-1)^n+(-2)^n)/2.
G.f.: x*(1+4*x)/((1+x)*(1+2*x)*(1-2*x)).
E.g.f.: (exp(2*x)-2*exp(-x)+exp(-2*x))/2.

A080925 Binomial transform of Jacobsthal gap sequence (A080924).

Original entry on oeis.org

0, 1, 5, 13, 41, 121, 365, 1093, 3281, 9841, 29525, 88573, 265721, 797161, 2391485, 7174453, 21523361, 64570081, 193710245, 581130733, 1743392201, 5230176601, 15690529805, 47071589413, 141214768241, 423644304721, 1270932914165

Offset: 0

Paul Barry, Feb 26 2003

Vincenzo Librandi, Table of n, a(n) for n = 0..300
Index entries for linear recurrences with constant coefficients, signature (2,3).

Cf. A080926. Essentially the same as A046717.

CoefficientList[Series[x (1 + 3 x) / ((1 + x) (1 - 3 x)), {x, 0, 40}], x] (* Vincenzo Librandi, Aug 05 2013 *)

a(n)=Sum{k=1..n, Binomial(n, 2k-2)2^(2k-2)}

a(n)=(3^n-2*0^n+(-1)^n)/2; G.f.: x(1+3x)/((1+x)(1-3x)); E.g.f.: (exp(3x)-2exp(0)+exp(-x))/2. - Paul Barry, May 19 2003

A211866 (9^n - 5) / 4.

Original entry on oeis.org

1, 19, 181, 1639, 14761, 132859, 1195741, 10761679, 96855121, 871696099, 7845264901, 70607384119, 635466457081, 5719198113739, 51472783023661, 463255047212959, 4169295424916641, 37523658824249779, 337712929418248021, 3039416364764232199, 27354747282878089801

Offset: 1

Reinhard Zumkeller, Feb 12 2013

(2*n, a(n)) are the solutions of Diophantine equation 3^x = 4*y + 5.
Second bisection of A080926. - Bruno Berselli, Feb 12 2013
Sum of n-th row of triangle of powers of 9: 1; 9 1 9; 81 9 1 9 81; 729 81 9 1 9 81 729; ... - Philippe Deléham, Feb 24 2014

			a(1) = 1;
a(2) = 9 + 1 + 9 = 19;
a(3) = 81 + 9 + 1 + 9 + 81 = 181;
a(4) = 729 + 81 + 9 + 1 + 9 + 81 + 729 = 1639; etc. - _Philippe Deléham_, Feb 24 2014

Jiri Herman, Radan Kucera and Jaromir Simsa, Equations and Inequalities, Springer (2000), p. 225 (5.3).

Vincenzo Librandi, Table of n, a(n) for n = 1..200
Index entries for linear recurrences with constant coefficients, signature (10,-9).

Cf. A000792, A001019, A080926, A084222.

a211866 = (flip div 4) . (subtract 5) . (9 ^)

I:=[1,19]; [n le 2 select I[n] else 10*Self(n-1)-9*Self(n-2): n in [1..25]]; // Vincenzo Librandi, Feb 26 2014

A211866:=n->(9^n-5)/4; seq(A211866(n), n=1..50); # Wesley Ivan Hurt, Nov 13 2013

(9^Range[25] - 5)/4 (* Bruno Berselli, Feb 12 2013 *)
CoefficientList[Series[(1 + 9 x)/((1 - x) (1 - 9 x)), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 26 2014 *)

makelist((9^n-5)/4,n,1,30); /* Martin Ettl, Feb 12 2013 */

a(n)=(9^n-5)/4 \\ Charles R Greathouse IV, Oct 07 2015

G.f.:  x*(1+9*x)/((1-x)*(1-9*x)). - Bruno Berselli, Feb 12 2013
a(n)-a(n-1) = A000792(6n-4). - Bruno Berselli, Feb 12 2013
a(n) = 9*a(n-1) + 10, a(1) = 1. - Philippe Deléham, Feb 24 2014
a(n) = -A084222(2*n). - Philippe Deléham, Feb 24 2014

cp's OEIS Frontend

A015518 a(n) = 2*a(n-1) + 3*a(n-2), with a(0)=0, a(1)=1.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

Maxima

PARI

Python

Sage

Formula

Extensions

A080924 Jacobsthal gap sequence.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A080925 Binomial transform of Jacobsthal gap sequence (A080924).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A211866 (9^n - 5) / 4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Formula

A164907 a(n) = (3*3^n-(-1)^n)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

A084568 a(0)=1, a(1)=5, a(n+2)=4a(n), n>0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A015518 a(n) = 2a(n-1) + 3a(n-2), with a(0)=0, a(1)=1.