A048473 -id:A048473 - cp's OEIS frontend

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

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

A094617 Triangular array T of numbers generated by these rules: 2 is in T; and if x is in T, then 2x-1 and 3x-2 are in T.

Original entry on oeis.org

2, 3, 4, 5, 7, 10, 9, 13, 19, 28, 17, 25, 37, 55, 82, 33, 49, 73, 109, 163, 244, 65, 97, 145, 217, 325, 487, 730, 129, 193, 289, 433, 649, 973, 1459, 2188, 257, 385, 577, 865, 1297, 1945, 2917, 4375, 6562, 513, 769, 1153, 1729, 2593, 3889, 5833, 8749, 13123, 19684

Offset: 1

Clark Kimberling, May 14 2004

To obtain row n from row n-1, apply 2x-1 to each x in row n-1 and then put 1+3^n at the end. Or, instead, apply 3x-2 to each x in row n-1 and then put 1+2^n at the beginning.
From Lamine Ngom, Feb 10 2021: (Start)
Triangle read by diagonals provides all the sequences of the form 1+2^(k-1)*3^n, where k is the k-th diagonal.
For instance, the terms of the first diagonal form the sequence 2, 4, 10, 28, ..., i.e., 1+3^n (A034472).
The 2nd diagonal leads to the sequence 3, 7, 19, 55, ..., i.e., 1+2*3^n (A052919).
The 3rd diagonal is the sequence 5, 13, 37, 109, ..., i.e., 1+4*3^n (A199108).
And for k = 4, we obtain the sequence 9, 25, 73, 217, ..., i.e., 1+8*3^n (A199111). (End)

			Rows of this triangle begin:
    2;
    3,   4;
    5,   7,   10;
    9,  13,   19,   28;
   17,  25,   37,   55,   82;
   33,  49,   73,  109,  163,  244;
   65,  97,  145,  217,  325,  487,  730;
  129, 193,  289,  433,  649,  973, 1459, 2188;
  257, 385,  577,  865, 1297, 1945, 2917, 4375,  6562;
  513, 769, 1153, 1729, 2593, 3889, 5833, 8749, 13123, 19684;
  ...

Ivan Neretin, Table of n, a(n) for n = 1..5151

Cf. A094616, A094618, A138247.

Cf. A034472, A052919, A199108, A199111.

FoldList[Append[2 #1 - 1, 1 + 3^#2] &, {2}, Range[9]] // Flatten (* Ivan Neretin, Mar 30 2016 *)

When offset is zero, then the first term is T(0,0) = 2, and
T(n,0) = 1 + 2^n = A000051(n),
T(n,n) = 1 + 3^n = A048473(n),
T(2n,n) = 1 + 6^n = A062394(n).
Row sums = A094618.
a(n) = A036561(n-1) + 1. - Filip Zaludek, Nov 19 2016

A134347 A007318^(-1) * A134346.

Original entry on oeis.org

1, 2, 3, 2, 8, 7, 2, 12, 24, 15, 2, 16, 48, 64, 31, 2, 20, 80, 160, 160, 63, 2, 24, 120, 320, 480, 384, 127, 2, 28, 168, 560, 1120, 1344, 896, 255, 2, 32, 224, 896, 2240, 3584, 3584, 2048, 511, 2, 36, 288, 1344, 4032, 8064, 10752, 9216, 4608, 1023

Offset: 0

Gary W. Adamson, Oct 21 2007

			First few rows of the triangle are:
  1;
  2,   3;
  2,   8,   7;
  2,  12,  24,  15;
  2,  16,  48,  64,  31;
  2,  20,  80, 160, 160,  63;
  2,  24, 120, 320, 480, 384, 127;
  ...

Cf. A007318, A134346, A048473 (row sums).

Inverse binomial transform of A134346, as infinite lower triangular matrices.

Conjecture: T(n,k) = 2^(k+1)*binomial(n,k) for k < n; T(n,n) = 2^(n+1)-1. - Knud Werner, Jan 05 2022

A210204 Triangle of coefficients of polynomials v(n,x) jointly generated with A210203; see the Formula section.

Original entry on oeis.org

1, 3, 2, 7, 8, 2, 15, 24, 12, 2, 31, 64, 48, 16, 2, 63, 160, 160, 80, 20, 2, 127, 384, 480, 320, 120, 24, 2, 255, 896, 1344, 1120, 560, 168, 28, 2, 511, 2048, 3584, 3584, 2240, 896, 224, 32, 2, 1023, 4608, 9216, 10752, 8064, 4032, 1344, 288, 36, 2, 2047

Offset: 1

Clark Kimberling, Mar 18 2012

Column 1:  -1+2^n.
Row sums: A048473.
Alternating row sums: 1,1,1,1,1,1,1,1,1,...
For a discussion and guide to related arrays, see A208510.
Row sums without first column give A056182. - Alois P. Heinz, Jan 14 2022

			First five rows:
1
3....2
7....8....2
15...24...12...2
31...64...48...16...2
First three polynomials v(n,x): 1, 3 + 2x , 7 + 8x + 2x^2.

Cf. A210203, A208510.

Cf. A056182.

u[1, x_] := 1; v[1, x_] := 1; z = 16;
u[n_, x_] := u[n - 1, x] + v[n - 1, x] + 1;
v[n_, x_] := (x + 1)*u[n - 1, x] + (x + 1)*v[n - 1, x] + 1;
Table[Expand[u[n, x]], {n, 1, z/2}]
Table[Expand[v[n, x]], {n, 1, z/2}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%]   (* A210203 *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%]   (* A210204 *)

u(n,x)=u(n-1,x)+v(n-1,x)+1,
v(n,x)=(x+1)*u(n-1,x)+(x+1)*v(n-1,x)+1,
where u(1,x)=1, v(1,x)=1.

A238303 Triangle T(n,k), 0<=k<=n, read by rows given by T(n,0) = 1, T(n,k) = 2 if k>0.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset: 0

Philippe Deléham, Feb 24 2014

Row sums are A005408(n).
Diagonals sums are A109613(n).
Sum_{k=0..n} T(n,k)*x^k = A033999(n), A000012(n), A005408(n), A036563(n+2), A058481(n+1), A083584(n), A137410(n), A233325(n), A233326(n), A233328(n), A211866(n+1), A165402(n+1) for x = -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 respectively.
Sum_{k=0..n} T(n,k)*x^(n-k) = A151575(n), 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 = -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 respectively.
Sum_{k=0..n} T(n,k)^x = A000027(n+1), A005408(n), A016813(n), A017077(n) for x = 0, 1, 2, 3 respectively.
Sum_{k=0..n} k*T(n,k) = A002378(n).
Sum_{k=0..n} A000045(k)*T(n,k) = A019274(n+2).
Sum_{k=0..n} A000142(k)*T(n,k) = A066237(n+1).

			Triangle begins:
1;
1, 2;
1, 2, 2;
1, 2, 2, 2;
1, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2;
1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2;
...

Antti Karttunen, Table of n, a(n) for n = 0..22154; the first 210 rows of triangle

Cf. Diagonals: A040000.
Cf. Columns: A000012, A007395.
First differences of A001614.

A238303(n) = (2-ispolygonal(n,3)); \\ Antti Karttunen, Jan 19 2025

T(n,0) = A000012(n) = 1, T(n+k,k) = A007395(n) = 2 for k>0.

Data section extended to a(104) by Antti Karttunen, Jan 19 2025

A240917 a(n) = 23^(2n) - 3*3^n + 1.

Original entry on oeis.org

0, 10, 136, 1378, 12880, 117370, 1060696, 9559378, 86073760, 774781930, 6973391656, 62761587778, 564857478640, 5083726873690, 45753570561016, 411782221142578, 3706040248563520, 33354363011912650, 300189269431736776, 2701703431859199778

Offset: 0

Kival Ngaokrajang, Apr 14 2014

a(n) is the total number of holes of a triflake-like fractal (fan pattern) after n iterations. The scale factor for this case is 1/3, but for the actual triflake case, it is 1/2, i.e., Sierpiński triangle. The total number of sides is 3*(A198643-1). The perimeter seems to converge to 10/6.

Kival Ngaokrajang, Illustration of triflake like fractal (fan pattern) for n = 0..3
Wikipedia, n-flake,
Index entries for linear recurrences with constant coefficients, signature (13,-39, 27).

Cf. A198643, A240523 (pentaflake), A240671 (heptaflake), A240572 (octaflake), A240733 (nonaflake), A240734 (decaflake), A240840 (hendecaflake), A240735 (dodecaflake), A240841 (tridecaflake).

A240917:=n->2*3^(2*n) - 3*3^n + 1; seq(A240917(n), n=0..30); # Wesley Ivan Hurt, Apr 15 2014

Table[2*3^(2 n) - 3*3^n + 1, {n, 0, 30}] (* Wesley Ivan Hurt, Apr 15 2014 *)

a(n)= 2*3^(2*n) - 3*3^n + 1
       for(n=0,100,print1(a(n),", "))

concat(0, Vec(-2*x*(3*x+5)/((x-1)*(3*x-1)*(9*x-1)) + O(x^100))) \\ Colin Barker, Apr 15 2014

a(n) = 2*A007742(A003462(n)).
a(n) = 9*(a(n-1) + 2*A048473(n-1)) + 1.
From Colin Barker, Apr 15 2014: (Start)
a(n) = 1-3^(1+n)+2*9^n.
a(n) = 13*a(n-1)-39*a(n-2)+27*a(n-3).
G.f.: -2*x*(3*x+5) / ((x-1)*(3*x-1)*(9*x-1)). (End).

A062547 a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).

Original entry on oeis.org

1, 3, 5, 7, 17, 19, 53, 55, 161, 163, 485, 487, 1457, 1459, 4373, 4375, 13121, 13123, 39365, 39367, 118097, 118099, 354293, 354295, 1062881, 1062883, 3188645, 3188647, 9565937, 9565939, 28697813, 28697815, 86093441, 86093443, 258280325, 258280327, 774840977

Offset: 0

Wouter Meeussen, Jun 26 2001

			Partial sums of 1;3;5 are 1;3;4;5;6;8;9 and 7 is the least missing odd integer, hence the next term is 7.

Index entries for linear recurrences with constant coefficients, signature (-1,3,3).

Cf. A048473, A052919, A062548.

Table[ -1+ 2 3^Floor[k/2]+2 Mod[k, 2], {k, 0, 36}]
LinearRecurrence[{-1,3,3},{1,3,5},40] (* Harvey P. Dale, Jul 14 2018 *)

a(2*n) = A048473(n); a(2n+1) = a(2n)+2.
For n > 0, a(2*n) = 3*a(2*n-1) - 4; a(2*n+1) = a(2*n) + 2 = A052919(n+1).
From Bruno Berselli, Jan 28 2011: (Start)
G.f.: (1+4*x+5*x^2)/((1+x)*(1-3*x^2)).
a(n) = -a(n-1) + 3*a(n-2) + 3*a(n-3) for n > 2.
a(n) = 2*3^((2*n + (-1)^n - 1)/4) - (-1)^n. (End)

Edited by Michel Marcus, Mar 16 2024

A094615 Triangular array T of numbers generated by these rules: 1 is in T; and if x is in T, then 2x+1 and 3x+2 are in T.

Original entry on oeis.org

1, 3, 5, 7, 11, 17, 15, 23, 35, 53, 31, 47, 71, 107, 161, 63, 95, 143, 215, 323, 485, 127, 191, 287, 431, 647, 971, 1457, 255, 383, 575, 863, 1295, 1943, 2915, 4373, 511, 767, 1151, 1727, 2591, 3887, 5831, 8747, 13121, 1023, 1535, 2303, 3455, 5183, 7775, 11663, 17495, 26243, 39365

Offset: 0

Clark Kimberling, May 14 2004

To obtain row n from row n-1, apply 2x+1 to each x in row n-1 and then put -1+2*3^n at the end. Or, instead, apply 3x+2 to each x in row n-1 and then put -1+2^(n+1) at the beginning.

Subtriangle of the triangle in A230445. - Philippe Deléham, Oct 31 2013

			Triangle begins:
  n\k|   1    2    3    4    5    6     7
  ---+-----------------------------------
  0  |   1;
  1  |   3,   5;
  2  |   7,  11,  17;
  3  |  15,  23,  35,  53;
  4  |  31,  47,  71, 107, 161;
  5  |  63,  95, 143, 215, 323, 485;
  6  | 127, 191, 287, 431, 647, 971, 1457;

Michel Marcus, Rows n=0..99 of triangle, flattened

Cf. A094616 (row sums), A094617, A230445.

Cf. A048473, A171498, A198644

tabl(nn) = {my(row = [1], nrow); for (n=1, nn, print (row); nrow = vector(n+1, k, if (k<=n, (2*row[k]+1), -1+2*3^n)); row = nrow;);} \\ Michel Marcus, Nov 14 2020

T(n,0) = -1+2^(n+1) = A000225(n+1).
T(n,n) = -1+2*3^n = A048473(n).
T(2n,n) = -1+2*6^n.
T(n,k) = -1 + 2^(n+1-k)*3^k. - Lamine Ngom, Feb 10 2021

Offset 0 and more terms from Michel Marcus, Nov 14 2020

A198645 a(n) = 10*3^n - 1.

Original entry on oeis.org

9, 29, 89, 269, 809, 2429, 7289, 21869, 65609, 196829, 590489, 1771469, 5314409, 15943229, 47829689, 143489069, 430467209, 1291401629, 3874204889, 11622614669, 34867844009, 104603532029, 313810596089, 941431788269, 2824295364809

Offset: 0

Vincenzo Librandi, Oct 28 2011

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

Cf. A048473.

Magma
```
[10*3^n-1: n in [0..30]]
```

10 * 3^Range[0,30]-1 (* Harvey P. Dale, Feb 28 2022 *)

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

G.f. ( 9-7*x ) / ( (3*x-1)*(x-1) ). - R. J. Mathar, Oct 30 2011

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A094617 Triangular array T of numbers generated by these rules: 2 is in T; and if x is in T, then 2x-1 and 3x-2 are in T.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A134347 A007318^(-1) * A134346.

Views

Author

Keywords

Examples

Crossrefs

Formula

A210204 Triangle of coefficients of polynomials v(n,x) jointly generated with A210203; see the Formula section.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A238303 Triangle T(n,k), 0<=k<=n, read by rows given by T(n,0) = 1, T(n,k) = 2 if k>0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions

A240917 a(n) = 2*3^(2*n) - 3*3^n + 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A062547 a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).

A240917 a(n) = 23^(2n) - 3*3^n + 1.