A100851 -id:A100851 - cp's OEIS frontend

A001021 Powers of 12.

1, 12, 144, 1728, 20736, 248832, 2985984, 35831808, 429981696, 5159780352, 61917364224, 743008370688, 8916100448256, 106993205379072, 1283918464548864, 15407021574586368, 184884258895036416, 2218611106740436992

Offset: 0

N. J. A. Sloane

Same as Pisot sequences E(1, 12), L(1, 12), P(1, 12), T(1, 12). Essentially same as Pisot sequences E(12, 144), L(12, 144), P(12, 144), T(12, 144). See A008776 for definitions of Pisot sequences.
Central terms of the triangle in A100851. - Reinhard Zumkeller, Mar 04 2006
The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n>=1, a(n) equals the number of 12-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
Starting with 12, this sequence appears in the film "Vollmond" (1998, dir. Fredi Murer), when the children write it on the sidewalk at night. - Alonso del Arte, Dec 21 2011

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..100
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 276.
Tanya Khovanova, Recursive Sequences.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Index entries for linear recurrences with constant coefficients, signature (12).

Cf. A024140 and A178248, 12^n +/- 1; A016125.

Cf. A000005, A000244, A000302, A000351, A000384, A001222, A008585, A008776, A100851, A159991.

a001021 = (12 ^)
a001021_list = iterate (* 12) 1  -- Reinhard Zumkeller, Mar 31 2012

A001021:=-1/(-1+12*z); # Simon Plouffe in his 1992 dissertation

Table[12^n, {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011 *)

a(n)=12^n \\ Charles R Greathouse IV, Dec 21 2011

G.f.: 1/(1-12*x).
E.g.f.: exp(12x).
a(n) = 12*a(n-1). - Zerinvary Lajos, Apr 27 2009
a(n) = A159991(n)/A000351(n). - Reinhard Zumkeller, May 02 2009
From Reinhard Zumkeller, Mar 31 2012: (Start)
a(n) = A000302(n) * A000244(n). - Reinhard Zumkeller, Mar 31 2012
A001222(a(n)) = A008585(n); A000005(a(n)) = A000384(a(n)). (End)
a(n) = det(|ps(i+2, j)|, 1 <= i, j <= n), where ps(n, k) are Legendre-Stirling numbers of the first kind. - Mircea Merca, Apr 04 2013

A016129 Expansion of 1/((1-2x)(1-6*x)).

Original entry on oeis.org

1, 8, 52, 320, 1936, 11648, 69952, 419840, 2519296, 15116288, 90698752, 544194560, 3265171456, 19591036928, 117546237952, 705277460480, 4231664828416, 25389989101568, 152339934871552, 914039609753600, 5484237659570176, 32905425959518208, 197432555761303552

Offset: 0

N. J. A. Sloane

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

Row sums of A100851.
Cf. A071951, A089278, A089500, A129467, A144843.
Sequences with gf 1/((1-n*x)*(1-6*x)): A000400 (n=0), A003464 (n=1), this sequence (n=2), A016137 (n=3), A016149 (n=4), A005062 (n=5), A053469 (n=6), A016169 (n=7), A016170 (n=8), A016172 (n=9), A016173 (n=10), A016174 (n=11), A016175 (n=12).

[(6^(n+1)-2^(n+1))/4 : n in [0..30]]; // Vincenzo Librandi, Oct 09 2011

Table[(6^(n+1) -2^(n+1))/4, {n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Jan 19 2011 *)
CoefficientList[Series[1/((1-2x)(1-6x)),{x,0,30}],x] (* or *) LinearRecurrence[{8,-12},{1,8},30] (* Harvey P. Dale, Jan 15 2015 *)

Vec(1/(1-2*x)/(1-6*x)+O(x^30)) \\ Charles R Greathouse IV, Apr 17 2012

[lucas_number1(n,8,12) for n in range(1, 31)] # Zerinvary Lajos, Apr 23 2009

[(6^n - 2^n)/4 for n in range(1,31)] # Zerinvary Lajos, Jun 04 2009

a(n) = A071951(n+2, 2) = 9*(2*3)^(n-1) - (2*1)^(n-1) = (2^(n-1))*(3^(n+1)-1), n>=0. - Wolfdieter Lang, Nov 07 2003
From Lambert Klasen (lambert.klasen(AT)gmx.net), Feb 05 2005: (Start)
G.f.: 1/((1-2*x)*(1-6*x)).
E.g.f.: (-exp(2*x) + 3*exp(6*x))/2.
a(n) = (6^(n+1) - 2^(n+1))/4. (End)
a(n)^2 = A144843(n+1). - Philippe Deléham, Nov 26 2008
a(n) = 8*a(n-1) - 12*a(n-2). - Philippe Deléham, Jan 01 2009
a(n) = det(|ps(i+2,j+1)|, 1 <= i,j <= n), where ps(n,k) are Legendre-Stirling numbers of the first kind (A129467). - Mircea Merca, Apr 06 2013

A100852 Triangle read by rows: T(n,k) = 2^k * 3^n, 0 <= k <= n.

Original entry on oeis.org

1, 3, 6, 9, 18, 36, 27, 54, 108, 216, 81, 162, 324, 648, 1296, 243, 486, 972, 1944, 3888, 7776, 729, 1458, 2916, 5832, 11664, 23328, 46656, 2187, 4374, 8748, 17496, 34992, 69984, 139968, 279936, 6561, 13122, 26244, 52488, 104976, 209952, 419904, 839808

Offset: 0

Reinhard Zumkeller, Nov 20 2004

T(n,0) = A000244(n); T(n,n) = A000400(n) = A100851(n,n);
T(n,1) = A008776(n) for n>0;
T(n,2) = A003946(n+1) for n>1;
T(n,3) = A005051(n+1) for n>2;
T(n,n-1) = A081341(n+1) for n>0;
row sums give A016137.

			Triangle begins:
   1;
   3,   6;
   9,  18,  36;
  27,  54, 108, 216;
  81, 162, 324, 648, 1296;
...

Michael De Vlieger, Table of n, a(n) for n = 0..10010 (Rows 0 <= n <= 140).
Eric Weisstein's World of Mathematics, Smooth Number

Cf. A100851, A003586, A065333(T(n, k))=1.

Table[2^k*3^n, {n, 0, 140}, {k, 0, n}] // Flatten (* Michael De Vlieger, Mar 06 2017 *)

for(n=0, 8, for(k=0, n, print1(2^k*3^n", "))) \\ Satish Bysany, Mar 06 2017

G.f.: 1/((1 - 3*x)(1 - 6*x*y)). - Ilya Gutkovskiy, Jun 03 2017

cp's OEIS Frontend

A001021 Powers of 12.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

A016129 Expansion of 1/((1-2x)(1-6*x)).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Sage

Formula

A100852 Triangle read by rows: T(n,k) = 2^k * 3^n, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

cp's OEIS Frontend

A001021 Powers of 12.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

A016129 Expansion of 1/((1-2*x)*(1-6*x)).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Sage

Formula

A100852 Triangle read by rows: T(n,k) = 2^k * 3^n, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A016129 Expansion of 1/((1-2x)(1-6*x)).