A112739 -id:A112739 - cp's OEIS frontend

A033484 a(n) = 3*2^n - 2.

1, 4, 10, 22, 46, 94, 190, 382, 766, 1534, 3070, 6142, 12286, 24574, 49150, 98302, 196606, 393214, 786430, 1572862, 3145726, 6291454, 12582910, 25165822, 50331646, 100663294, 201326590, 402653182, 805306366, 1610612734, 3221225470

Offset: 0

N. J. A. Sloane

Number of nodes in rooted tree of height n in which every node (including the root) has valency 3.
Pascal diamond numbers: reflect Pascal's n-th triangle vertically and sum all elements. E.g., a(3)=1+(1+1)+(1+2+1)+(1+1)+1. - Paul Barry, Jun 23 2003
Number of 2 X n binary matrices avoiding simultaneously the right-angled numbered polyomino patterns (ranpp) (00;1), (10;0) and (11;0). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1 < i2 and j1 < j2 and these elements are in the same relative order as those in the triple (x,y,z). - Sergey Kitaev, Nov 11 2004
Binomial and inverse binomial transform are in A001047 (shifted) and A122553. - R. J. Mathar, Sep 02 2008
a(n) = (Sum_{k=0..n-1} a(n)) + (2*n + 1); e.g., a(3) = 22 = (1 + 4 + 10) + 7. - Gary W. Adamson, Jan 21 2009
Let P(A) be the power set of an n-element set A and R be a relation on P(A) such that for all x, y of P(A), xRy if either 0) x is a proper subset of y or y is a proper subset of x and x and y are disjoint, or 1) x equals y. Then a(n) = |R|. - Ross La Haye, Mar 19 2009
Equals the Jacobsthal sequence A001045 convolved with (1, 3, 4, 4, 4, 4, 4, ...). - Gary W. Adamson, May 24 2009
Equals the eigensequence of a triangle with the odd integers as the left border and the rest 1's. - Gary W. Adamson, Jul 24 2010
An elephant sequence, see A175655. For the central square four A[5] vectors, with decimal values 58, 154, 178 and 184, lead to this sequence. For the corner squares these vectors lead to the companion sequence A097813. - Johannes W. Meijer, Aug 15 2010
a(n+2) is the integer with bit string "10" * "1"^n * "10".
a(n) = A027383(2n). - Jason Kimberley, Nov 03 2011
a(n) = A153893(n)-1 = A083416(2n+1). - Philippe Deléham, Apr 14 2013
a(n) = A082560(n+1,A000079(n)) = A232642(n+1,A128588(n+1)). - Reinhard Zumkeller, May 14 2015
a(n) is the sum of the entries in the n-th and (n+1)-st rows of Pascal's triangle minus 2. - Stuart E Anderson, Aug 27 2017
Also the number of independent vertex sets and vertex covers in the complete tripartite graph K_{n,n,n}. - Eric W. Weisstein, Sep 21 2017
Apparently, a(n) is the least k such that the binary expansion of A000045(k) ends with exactly n+1 ones. - Rémy Sigrist, Sep 25 2021
a(n) is the number of root ancestral configurations for a pair consisting of a matching gene tree and species tree with the modified lodgepole shape and n+1 cherry nodes. - Noah A Rosenberg, Jan 16 2025

			Binary: 1, 100, 1010, 10110, 101110, 1011110, 10111110, 101111110, 1011111110, 10111111110, 101111111110, 1011111111110, 10111111111110,
G.f. = 1 + 4*x + 10*x^2 + 22*x^3 + 46*x^4 + 94*x^5 + 190*x^6 + 382*x^7 + ...

J. Riordan, Series-parallel realization of the sum modulo 2 of n switching variables, in Claude Elwood Shannon: Collected Papers, edited by N. J. A. Sloane and A. D. Wyner, IEEE Press, NY, 1993, pp. 877-878.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Paul Barry, The Triple Riordan Group, arXiv:2412.05461 [math.CO], 2024. See pp. 3, 10.
Dennis E. Davenport, Shakuan K. Frankson, Louis W. Shapiro, and Leon C. Woodson, An Invitation to the Riordan Group, Enum. Comb. Appl. (2024) Vol. 4, No. 3, Art. #S2S1. See p. 22.
Erik D. Demaine et al., Picture-Hanging Puzzles, arXiv:1203.3602 [cs.DS], 2012, 2014. See p. 8, actually length(Sn) is 2^n+2^(n-1)-2, that is, a(n-1).
Sergey Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
Ross La Haye, Binary Relations on the Power Set of an n-Element Set, Journal of Integer Sequences, Vol. 12 (2009), Article 09.2.6.
Egor Lappo and Noah A. Rosenberg, A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees, Adv. Appl. Math. 343 (2024), 65-81.
Eric Weisstein's World of Mathematics, Complete Tripartite Graph
Eric Weisstein's World of Mathematics, Independent Vertex Set
Eric Weisstein's World of Mathematics, Vertex Cover
Index entries for linear recurrences with constant coefficients, signature (3,-2).

Cf. A000045, A007283, A036563, A131110, A051597, A132776, A001045.
Cf. A000918.
Cf. A112468, A112739.
Cf. A082560, A000079, A232642, A128588.

List([0..35], n-> 3*2^n -2); # G. C. Greubel, Nov 18 2019

a033484 = (subtract 2) . (* 3) . (2 ^)
a033484_list = iterate ((subtract 2) . (* 2) . (+ 2)) 1
-- Reinhard Zumkeller, Apr 23 2013

[3*2^n-2: n in [1..36]]; // Vincenzo Librandi, Nov 22 2010

with(combinat):a:=n->stirling2(n,2)+stirling2(n+1,2): seq(a(n), n=1..35); # Zerinvary Lajos, Oct 07 2007
a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=(a[n-1]+1)*2 od: seq(a[n], n=1..35); # Zerinvary Lajos, Feb 22 2008

Table[3 2^n - 2, {n, 0, 35}] (* Vladimir Joseph Stephan Orlovsky, Dec 16 2008 *)
(* Start from Eric W. Weisstein, Sep 21 2017 *)
3*2^Range[0, 35] - 2
LinearRecurrence[{3, -2}, {1, 4}, 36]
CoefficientList[Series[(1+x)/(1-3x+2x^2), {x, 0, 35}], x] (* End *)

a(n) = 3<Charles R Greathouse IV, Nov 02 2011

[3*2^n -2 for n in (0..35)] # G. C. Greubel, Nov 18 2019

G.f.: (1+x)/(1-3*x+2*x^2).
a(n) = 2*(a(n-1) + 1) for n>0, with a(0)=1.
a(n) = A007283(n) - 2.
G.f. is equivalent to (1-2*x-3*x^2)/((1-x)*(1-2*x)*(1-3*x)). - Paul Barry, Apr 28 2004
From Reinhard Zumkeller, Oct 09 2004: (Start)
A099257(a(n)) = A099258(a(n)) = a(n).
a(n) = 2*A055010(n) = (A068156(n) - 1)/2. (End)
Row sums of triangle A130452. - Gary W. Adamson, May 26 2007
Row sums of triangle A131110. - Gary W. Adamson, Jun 15 2007
Binomial transform of (1, 3, 3, 3, ...). - Gary W. Adamson, Oct 17 2007
Row sums of triangle A051597 (a triangle generated from Pascal's rule given right and left borders = 1, 2, 3, ...). - Gary W. Adamson, Nov 04 2007
Equals A132776 * [1/1, 1/2, 1/3, ...]. - Gary W. Adamson, Nov 16 2007
a(n) = Sum_{k=0..n} A112468(n,k)*3^k. - Philippe Deléham, Feb 23 2014
a(n) = -(2^n) * A036563(1-n) for all n in Z. - Michael Somos, Jul 04 2017
E.g.f.: 3*exp(2*x) - 2*exp(x). - G. C. Greubel, Nov 18 2019

A048473 a(0)=1, a(n) = 3a(n-1) + 2; a(n) = 23^n - 1.

Original entry on oeis.org

1, 5, 17, 53, 161, 485, 1457, 4373, 13121, 39365, 118097, 354293, 1062881, 3188645, 9565937, 28697813, 86093441, 258280325, 774840977, 2324522933, 6973568801, 20920706405, 62762119217, 188286357653, 564859072961, 1694577218885, 5083731656657, 15251194969973, 45753584909921

Offset: 0

Clark Kimberling

The number of triangles (of all sizes, including holes) in Sierpiński's triangle after n inscriptions. - Lee Reeves, May 10 2004
The sequence is not only related to Sierpiński's triangle, but also to "Floret's cube" and the quaternion factor space Q X Q / {(1,1), (-1,-1)}. It can be written as a_n = ves((A+1)x)^n) as described at the Math Forum Discussions link. - Creighton Dement, Jul 28 2004
Relation to C(n) = Collatz function iteration using only odd steps: If we look for record subsequences where C(n) > n, this subsequence starts at 2^n - 1 and stops at the local maximum of 2*3^n - 1. Examples: [3,5], [7,11,17], [15,23,35,53], ..., [127,191,287,431,647,971,1457]. - Lambert Klasen, Mar 11 2005
Group the natural numbers so that the (2n-1)-th group sum is a multiple of the (2n)-th group containing one term. (1,2),(3),(4,5,6,7,8,9,10,11),(12),(13,14,15,16,17,18,19,...,38),(39),(40,41,...,118,119),(120), (121,122,123,...) ... a(n) = {the sum of the terms of (2n-1)-th group}/{the term of (2n)th group}. The first term of the odd numbered group is given by A003462. The only term of even numbered group is given by A029858. - Amarnath Murthy, Aug 01 2005
a(n)+1 = A008776(n); it appears that this gives the number of terms in the (n+1)-th "gap" of numbers missing in A171884. - M. F. Hasler, May 09 2013
Sum of n-th row of triangle of powers of 3: 1; 1 3 1; 1 3 9 3 1; 1 3 9 27 9 3 1; ... - Philippe Deléham, Feb 23 2014
For n >= 3, also the number of dominating sets in the n-helm graph. - Eric W. Weisstein, May 28 2017
The number of elements of length <= n in the free group on two generators. - Anton Mellit, Aug 10 2017
In general, a first order inhomogeneous recurrence of the form s(0) = a, s(n) = m*s(n-1) + k, n>0, will have a closed form of a*m^n + ((m^n-1)/(m-1))*k. - Gary Detlefs, Jun 07 2024

			a(0) = 1;
a(1) = 1 + 3 + 1 = 5;
a(2) = 1 + 3 + 9 + 3 + 1 = 17;
a(3) = 1 + 3 + 9 + 27 + 9 + 3 + 1 = 53; etc. - _Philippe Deléham_, Feb 23 2014

Theoni Pappas, Math Stuff, Wide World Publ/Tetra, San Carlos CA, page 15, 2002.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Creighton Dement, A paper on floretions and quaternions, some questions, The Math Forum.
Eric Weisstein's World of Mathematics, Dominating Set.
Eric Weisstein's World of Mathematics, Helm Graph.
Index entries for linear recurrences with constant coefficients, signature (4,-3).

a(n)=T(2,n), array T given by A048471.
Cf. A003462, A029858. A column of A119725.
Cf. A008776, A010684, A046055, A112468, A112739, A134347, A171884.

[2*3^n - 1: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011

g:= ((1+x)/(1-3*x)/(1-x)): gser:=series(g, x=0, 43): seq(coeff(gser, x, n), n=0..30); # Zerinvary Lajos, Jan 11 2009; typo fixed by Marko Mihaily, Mar 07 2009

NestList[3 # + 2 &, 1, 30] (* Harvey P. Dale, Mar 06 2012 *)
LinearRecurrence[{4, -3}, {1, 5}, 30] (* Harvey P. Dale, Mar 06 2012 *)
Table[2 3^n - 1, {n, 20}] (* Eric W. Weisstein, May 28 2017 *)
2 3^Range[20] - 1 (* Eric W. Weisstein, May 28 2017 *)

first(m)=vector(m,n,n--;2*3^n - 1) \\ Anders Hellström, Dec 11 2015

n-th difference of a(n), a(n-1), ..., a(0) is 2^(n+1) for n=1, 2, 3, ...
a(0)=1, a(n) = a(n-1) + 3^n + 3^(n-1). - Lee Reeves, May 10 2004
a(n) = (3^n + 3^(n+1) - 2)/2. - Creighton Dement, Jul 31 2004
(1, 5, 17, 53, 161, ...) = Ternary (1, 12, 122, 1222, 12222, ...). - Gary W. Adamson, May 02 2005
Row sums of triangle A134347. Also, binomial transform of A046055: (1, 4, 8, 16, 32, 64, ...); and double binomial transform of A010684: (1, 3, 1, 3, 1, 3, ...). - Gary W. Adamson, Oct 21 2007
G.f.: (1+x)/((1-3*x)*(1-x)). - Zerinvary Lajos, Jan 11 2009; corrected by R. J. Mathar, Jan 21 2009
a(0)=1, a(1)=5, a(n) = 4*a(n-1) - 3*a(n-2). - Harvey P. Dale, Mar 06 2012
a(n) = Sum_{k=0..n} A112468(n,k)*4^k. - Philippe Deléham, Feb 23 2014
E.g.f.: exp(x)*(2*exp(2*x) - 1). - Elmo R. Oliveira, Mar 08 2025

Better description from Amarnath Murthy, May 27 2001

A112468 Riordan array (1/(1-x), x/(1+x)).

Original entry on oeis.org

1, 1, 1, 1, 0, 1, 1, 1, -1, 1, 1, 0, 2, -2, 1, 1, 1, -2, 4, -3, 1, 1, 0, 3, -6, 7, -4, 1, 1, 1, -3, 9, -13, 11, -5, 1, 1, 0, 4, -12, 22, -24, 16, -6, 1, 1, 1, -4, 16, -34, 46, -40, 22, -7, 1, 1, 0, 5, -20, 50, -80, 86, -62, 29, -8, 1, 1, 1, -5, 25, -70, 130, -166, 148, -91, 37, -9, 1, 1, 0, 6, -30, 95, -200, 296, -314, 239, -128, 46, -10, 1

Offset: 0

Paul Barry, Sep 06 2005

Row sums are A040000. Diagonal sums are A112469. Inverse is A112467. Row sums of k-th power are 1, k+1, k+1, k+1, .... Note that C(n,k) = Sum_{j=0..n-k} C(n-j-1, n-k-j).
Equals row reversal of triangle A112555 up to sign, where log(A112555) = A112555 - I. Unsigned row sums equals A052953 (Jacobsthal numbers + 1). Central terms of even-indexed rows are a signed version of A072547. Sums of squared terms in rows yields A112556, which equals the first differences of the unsigned central terms. - Paul D. Hanna, Jan 20 2006
Sum_{k=0..n} T(n,k)*x^k = A000012(n), A040000(n), A005408(n), A033484(n), A048473(n), A020989(n), A057651(n), A061801(n), A238275(n), A238276(n), A138894(n), A090843(n), A199023(n) for x = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 respectively (see the square array in A112739). - Philippe Deléham, Feb 22 2014

			Triangle starts
  1;
  1,  1;
  1,  0,  1;
  1,  1, -1,  1;
  1,  0,  2, -2,  1;
  1,  1, -2,  4, -3,  1;
  1,  0,  3, -6,  7, -4,  1;
Matrix log begins:
  0;
  1,  0;
  1,  0,  0;
  1,  1, -1,  0;
  1,  1,  1, -2,  0;
  1,  1,  1,  1, -3,  0; ...
Production matrix begins
  1,  1,
  0, -1,  1,
  0,  0, -1,  1,
  0,  0,  0, -1,  1,
  0,  0,  0,  0, -1,  1,
  0,  0,  0,  0,  0, -1,  1,
  0,  0,  0,  0,  0,  0, -1,  1.
- _Paul Barry_, Apr 08 2011

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened
H. Belbachir and F. Bencherif, On some properties of bivariate Fibonacci and Lucas Polynomials, JIS 11 (2008) 08.2.6.
Hacene Belbachir and Athmane Benmezai, Expansion of Fibonacci and Lucas Polynomials: An Answer to Prodinger's Question, Journal of Integer Sequences, Vol. 15 (2012), #12.7.6.
Emeric Deutsch, L. Ferrari and S. Rinaldi, Production Matrices, Advances in Applied Mathematics, 34 (2005) pp. 101-122.
Kyu-Hwan Lee and Se-jin Oh, Catalan triangle numbers and binomial coefficients, arXiv:1601.06685 [math.CO], 2016.
H. Prodinger, On the expansion of Fibonacci and Lucas Polynomials, JIS 12 (2009) 09.1.6.

Cf. A174294, A174295, A174296, A174297. - Mats Granvik, Mar 15 2010
Cf. A072547 (central terms), A112555 (reversed rows), A112465, A052953, A112556, A112739, A119258.
See A279006 for another version.

T:= function(n,k)
    if k=0 or k=n then return 1;
    else return T(n-1,k-1) - T(n-1,k);
    fi;
  end;
Flat(List([0..12], n-> List([0..n], k-> T(n,k) ))); # G. C. Greubel, Nov 13 2019

a112468 n k = a112468_tabl !! n !! k
a112468_row n = a112468_tabl !! n
a112468_tabl = iterate (\xs -> zipWith (-) ([2] ++ xs) (xs ++ [0])) [1]
-- Reinhard Zumkeller, Jan 03 2014

function T(n,k)
  if k eq 0 or k eq n then return 1;
  else return T(n-1,k-1) - T(n-1,k);
  end if;
  return T;
end function;
[T(n,k): k in [0..n], n in [0..12]]; // G. C. Greubel, Nov 13 2019

T := (n,k,m) -> (1-m)^(-n+k)-m^(k+1)*pochhammer(n-k,k+1)*hypergeom( [1,n+1],[k+2],m)/(k+1)!; A112468 := (n,k) -> T(n,n-k,-1);
seq(print(seq(simplify(A112468(n,k)),k=0..n)),n=0..10); # Peter Luschny, Jul 25 2014

T[n_, 0] = 1; T[n_, n_] = 1; T[n_, k_ ]:= T[n, k] = T[n-1, k-1] - T[n-1, k]; Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* Jean-François Alcover, Mar 06 2013 *)

{T(n,k)=local(m=1,x=X+X*O(X^n),y=Y+Y*O(Y^k)); polcoeff(polcoeff((1+(m-1)*x)*(1+m*x)/(1+m*x-x*y)/(1-x),n,X),k,Y)} \\ Paul D. Hanna, Jan 20 2006

T(n,k) = if(k==0 || k==n, 1, T(n-1, k-1) - T(n-1, k)); \\ G. C. Greubel, Nov 13 2019

@CachedFunction
def T(n, k):
    if (k<0 or n<0): return 0
    elif (k==0 or k==n): return 1
    else: return T(n-1, k-1) - T(n-1, k)
[[T(n, k) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Nov 13 2019

Triangle T(n,k) read by rows: T(n,0)=1, T(n,k) = T(n-1,k-1) - T(n-1,k). - Mats Granvik, Mar 15 2010
Number triangle T(n, k)= Sum_{j=0..n-k} C(n-j-1, n-k-j)*(-1)^(n-k-j).
G.f. of matrix power T^m: (1+(m-1)*x)*(1+m*x)/(1+m*x-x*y)/(1-x). G.f. of matrix log: x*(1-2*x*y+x^2*y)/(1-x*y)^2/(1-x). - Paul D. Hanna, Jan 20 2006
T(n, k) = R(n,n-k,-1) where R(n,k,m) = (1-m)^(-n+k)-m^(k+1)*Pochhammer(n-k,k+1)*hyper2F1([1,n+1],[k+2],m)/(k+1)!. - Peter Luschny, Jul 25 2014

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

Original entry on oeis.org

1, 7, 37, 187, 937, 4687, 23437, 117187, 585937, 2929687, 14648437, 73242187, 366210937, 1831054687, 9155273437, 45776367187, 228881835937, 1144409179687, 5722045898437, 28610229492187, 143051147460937, 715255737304687, 3576278686523437, 17881393432617187, 89406967163085937

Offset: 0

N. J. A. Sloane, Oct 13 2000

Sum of n-th row of triangle of powers of 5: 1; 1 5 1; 1 5 25 5 1 ; 1 5 25 125 25 5 1; ... - Philippe Deléham, Feb 23 2014

			a(0) = 1;
a(1) = 1 + 5 + 1 = 7;
a(2) = 1 + 5 + 25 + 5 + 1 = 37;
a(3) = 1 + 5 + 25 + 125 + 25 + 5 + 1 = 187; etc. - _Philippe Deléham_, Feb 23 2014
G.f. = 1 + 7*x + 37*x^2 + 187*x^3 + 937*x^4 + 4687*x^5 + 23437*x^6 + ...

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-5).

Cf. A024049, A081655, A097162, A198762.

Cf. A020989, A061801, A112468, A112739.

[(3*5^n-1)/2: n in [0..30]]; // Vincenzo Librandi, Oct 30 2011

G.f=(1+x)/(1-5*x)/(1-x): gser:=series(g, x=0, 43): seq(coeff(gser, x, n), n=0..30); # Zerinvary Lajos, Jan 11 2009

Table[(3*5^n-1)/2,{n,0,30}] (* Vladimir Joseph Stephan Orlovsky, Jan 29 2012 *)

a(n)=3*5^n\2 \\ Charles R Greathouse IV, Dec 22 2011

G.f.: (1+x)/(1 - 6*x + 5*x^2).
a(0)=1, a(n) = 5*a(n-1) + 2; a(n) = a(n-1) + 6*(5^(n-1)). - Amarnath Murthy, May 27 2001
a(n) = 6*a(n-1) - 5*a(n-2), n > 1. - Vincenzo Librandi, Oct 30 2011
a(n) = Sum_{k=0..n} A112468(n,k)*6^k. - Philippe Deléham, Feb 23 2014
From Elmo R. Oliveira, Mar 29 2025: (Start)
E.g.f.: exp(x)*(3*exp(4*x) - 1)/2.
a(n) = A097162(2*n) = A198762(n)/2. (End)

A090843 Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.

Original entry on oeis.org

1, 12, 122, 1222, 12222, 122222, 1222222, 12222222, 122222222, 1222222222, 12222222222, 122222222222, 1222222222222, 12222222222222, 122222222222222, 1222222222222222, 12222222222222222, 122222222222222222, 1222222222222222222, 12222222222222222222, 122222222222222222222

Offset: 0

Paul Barry, Dec 09 2003

Sum of n-th row of triangle of powers of 10: 1; 1 10 1; 1 10 100 10 1; 1 10 100 1000 100 10 1; ... - Philippe Deléham, Feb 23 2014

			a(0) = 1;
a(1) = 1 + 10 + 1 = 12;
a(2) = 1 + 10 + 100 + 10 + 1 = 122;
a(3) = 1 + 10 + 100 + 1000 + 100 + 10 + 1 = 1222; etc. - _Philippe Deléham_, Feb 23 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..100
Li He, Xiangwei Liu, and Gilbert Strang, Trees with Cantor Eigenvalue Distribution, Studies in Applied Mathematics, Vol. 110(2), 2003, pp. 123-138.
Index entries for linear recurrences with constant coefficients, signature (11,-10).

Cf. A112468, A112739.

g:=(1+z)/((1-z)* (1-10*z)): gser:=series(g, z=0, 43): seq((coeff(gser, z, n)), n=0..24); # Zerinvary Lajos, Feb 25 2009

Table[(11 10^n - 2)/9, {n, 0, 20}] (* Vincenzo Librandi, Feb 24 2014 *)

a(n) = (11*10^n - 2)/9.
G.f.: (1+x)/((1-x)*(1-10*x)). - Zerinvary Lajos, Feb 25 2009
From Philippe Deléham, Feb 23 2014: (Start)
a(n) = 10*a(n-1) + 2, a(0) = 1.
a(n) = 11*a(n-1) - 10*a(n-2), a(0) = 1, a(1) = 12.
a(n) = Sum_{k=0..n} A112468(n,k)*11^k. (End)
E.g.f.: exp(x)*(11*exp(9*x) - 2)/9. - Elmo R. Oliveira, May 07 2025

A061801 a(n) = (7*6^n - 2)/5.

Original entry on oeis.org

1, 8, 50, 302, 1814, 10886, 65318, 391910, 2351462, 14108774, 84652646, 507915878, 3047495270, 18284971622, 109709829734, 658258978406, 3949553870438, 23697323222630, 142183939335782, 853103636014694

Offset: 0

Amarnath Murthy, May 28 2001

Sum of n-th row of triangle of powers of 6: 1; 1 6 1; 1 6 36 6 1; 1 6 36 216 36 6 1; ....

			a(2) = 50 = 1 + 6 + 36 + 6 + 1.
G.f. = 1 + 8*x + 50*x^2 + 302*x^3 + 1814*x^4 + 10886*x^5 + 65318*x^6 + ...

Harry J. Smith, Table of n, a(n) for n=0,...,200

Cf. A057651, A112468, A112739.

restart:g:=(1+x)/(1-6*x)/(1-x): gser:=series(g, x=0, 43): seq(coeff(gser, x, n), n=0..30); # Zerinvary Lajos, Jan 11 2009

{ for (n=0, 200, write("b061801.txt", n, " ", (7*6^n - 2)/5) ) } \\ Harry J. Smith, Jul 28 2009

G.f.: (1+x)/(1-6*x)/(1-x) [Zerinvary Lajos, Jan 11 2009]
a(n) = 6*a(n-1) + 2, a(0) = 1. - Philippe Deléham, Feb 23 2014
a(n) = Sum_{k=0..n} A112468(n,k)*7^k. - Philippe Deléham, Feb 23 2014

More terms from Larry Reeves (larryr(AT)acm.org) and Jason Earls, May 28 2001.
Better description from Dean Hickerson, Jun 06 2001
Divided g.f. by x to match the offset. - Philippe Deléham, Feb 23 2014

A199023 a(n) = (6*11^n - 1)/5.

Original entry on oeis.org

1, 13, 145, 1597, 17569, 193261, 2125873, 23384605, 257230657, 2829537229, 31124909521, 342374004733, 3766114052065, 41427254572717, 455699800299889, 5012697803298781, 55139675836286593, 606536434199152525, 6671900776190677777, 73390908538097455549, 807299993919072011041

Offset: 0

Vincenzo Librandi, Nov 02 2011

Sum of n-th row of triangle of powers of 11: 1; 1 11 1; 1 11 121 11 1; 1 11 121 1331 121 11 1; ... - Philippe Deléham, Feb 23 2014

			a(0) = 1;
a(1) = 1 + 11 + 1 = 13;
a(2) = 1 + 11 + 121 + 11 + 1 = 145;
a(3) = 1 + 11 + 121 + 1331 + 121 + 11 + 1 = 1597; etc. - _Philippe Deléham_, Feb 23 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..900
Index entries for linear recurrences with constant coefficients, signature (12,-11).

Cf. A112468, A112739, A199024.

Magma
```
[(6*11^n-1)/5 : n in [0..20]];
```

CoefficientList[Series[(1 + x)/(1 - 12*x + 11*x^2), {x, 0, 30}], x] (* Vincenzo Librandi, Jan 04 2013 *)

a(n)=(6*11^n-1)/5 \\ Charles R Greathouse IV, Oct 07 2015

a(n) = 11*a(n-1) + 2.
a(n) = 12*a(n-1) - 11*a(n-2), n > 1.
G.f.: (1 + x)/(1 - 12*x + 11*x^2). - Vincenzo Librandi, Jan 04 2013
a(n) = Sum_{k=0..n} A112468(n,k)*12^k. - Philippe Deléham, Feb 23 2014
From Elmo R. Oliveira, Mar 02 2025: (Start)
E.g.f.: exp(x)*(6*exp(10*x) - 1)/5.
a(n) = A199024(n)/5. (End)

A238275 a(n) = (4*7^n - 1)/3.

Original entry on oeis.org

1, 9, 65, 457, 3201, 22409, 156865, 1098057, 7686401, 53804809, 376633665, 2636435657, 18455049601, 129185347209, 904297430465, 6330082013257, 44310574092801, 310174018649609, 2171218130547265, 15198526913830857, 106389688396816001, 744727818777712009

Offset: 0

Philippe Deléham, Feb 21 2014

Sum of n-th row of triangle of powers of 7: 1; 1 7 1; 1 7 49 7 1; 1 7 49 343 49 7 1; ...

Number of cubes in the crystal structure cubic carbon CCC(n+1), defined in the Baig et al. and in the Gao et al. references. - Emeric Deutsch, May 28 2018

			a(0) = 1;
a(1) = 1 + 7 + 1 = 9;
a(2) = 1 + 7 + 49 + 7 + 1 = 65;
a(3) = 1 + 7 + 49 + 343 + 49 + 7 + 1 = 457; etc.

Vincenzo Librandi, Table of n, a(n) for n = 0..200
A. Q. Baig, M. Imran, W. Khalid, and M. Naeem, Molecular description of carbon graphite and crystal cubic carbon structures, Canadian J. Chem., 95, 674-686, 2017.
W. Gao, M. K. Siddiqui, M. Naeem and N. A. Rehman, Topological characterization of carbon graphite and crystal cubic carbon structures, Molecules, 22, 1496, 1-12, 2017.
Index entries for linear recurrences with constant coefficients, signature (8,-7).

Cf. Similar sequences: A151575, A000012, A040000, A005408, A033484, A048473, A020989, A057651, A061801, this sequence, A238276, A138894, A090843, A199023.

Cf. A112468, A112739.

[(4*7^n - 1)/3: n in [0..30]]; // Vincenzo Librandi, Feb 23 2014

Table[(4 7^n - 1)/3, {n, 0, 40}] (* Vincenzo Librandi, Feb 23 2014 *)

G.f.: (1+x)/((1-x)*(1-7*x)).
a(n) = 7*a(n-1) + 2, a(0) = 1.
a(n) = 8*a(n-1) - 7*a(n-2), a(0) = 1, a(1) = 9.
a(n) = Sum_{k=0..n} A112468(n,k)*8^k.
E.g.f.: exp(x)*(4*exp(6*x) - 1)/3. - Stefano Spezia, Feb 12 2025

A238276 a(n) = (9*8^n - 2)/7.

Original entry on oeis.org

1, 10, 82, 658, 5266, 42130, 337042, 2696338, 21570706, 172565650, 1380525202, 11044201618, 88353612946, 706828903570, 5654631228562, 45237049828498, 361896398627986, 2895171189023890, 23161369512191122, 185290956097528978, 1482327648780231826

Offset: 0

Philippe Deléham, Feb 21 2014

Sum of n-th row of triangle of powers of 8: 1; 1 8 1; 1 8 64 8 1; 1 8 64 512 64 8 1; ...

			a(0) = 1;
a(1) = 1 + 8 + 1 = 10;
a(2) = 1 + 8 + 64 + 8 + 1 = 82;
a(3) = 1 + 8 + 64 + 512 + 64 + 8 + 1 = 658; etc.

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

Cf. Similar sequences: A151575, A000012, A040000, A005408, A033484, A048473, A020989, A057651, A061801, A238275, this sequence, A138894, A090843, A199023.

Cf. A112468, A112739.

[(9*8^n - 2)/7: n in [0..30]]; // Vincenzo Librandi, Feb 23 2014

Table[(9 8^n - 2)/7, {n, 0, 50}] (* Vincenzo Librandi, Feb 23 2014 *)

G.f.: (1+x)/((1-x)*(1-8*x)).
a(n) = 8*a(n-1) + 2, a(0) = 1.
a(n) = 9*a(n-1) - 8*a(n-2), a(0) = 1, a(1) = 10.
a(n) = Sum_{k=0..n} A112468(n,k)*9^k.

Corrected by Vincenzo Librandi, Feb 23 2014

cp's OEIS Frontend

A112740 Row sums of number triangle A112739.

Views

Author

Keywords

Formula

A033484 a(n) = 3*2^n - 2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Sage

Formula

A048473 a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A112468 Riordan array (1/(1-x), x/(1+x)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A090843 Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A048473 a(0)=1, a(n) = 3a(n-1) + 2; a(n) = 23^n - 1.