A038220 -id:A038220 - cp's OEIS frontend

A000351 Powers of 5: a(n) = 5^n.

1, 5, 25, 125, 625, 3125, 15625, 78125, 390625, 1953125, 9765625, 48828125, 244140625, 1220703125, 6103515625, 30517578125, 152587890625, 762939453125, 3814697265625, 19073486328125, 95367431640625, 476837158203125, 2384185791015625, 11920928955078125

Offset: 0

N. J. A. Sloane

Same as Pisot sequences E(1, 5), L(1, 5), P(1, 5), T(1, 5). Essentially same as Pisot sequences E(5, 25), L(5, 25), P(5, 25), T(5, 25). See A008776 for definitions of Pisot sequences.
a(n) has leading digit 1 if and only if n = A067497 - 1. - Lekraj Beedassy, Jul 09 2002
With interpolated zeros 0, 1, 0, 5, 0, 25, ... (g.f.: x/(1 - 5*x^2)) second inverse binomial transform of Fibonacci(3n)/Fibonacci(3) (A001076). Binomial transform is A085449. - Paul Barry, Mar 14 2004
Sums of rows of the triangles in A013620 and A038220. - Reinhard Zumkeller, May 14 2006
Sum of coefficients of expansion of (1 + x + x^2 + x^3 + x^4)^n. a(n) is number of compositions of natural numbers into n parts less than 5. a(2) = 25 there are 25 compositions of natural numbers into 2 parts less than 5. - Adi Dani, Jun 22 2011
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 5-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
Numbers n such that sigma(5n) = 5n + sigma(n). In fact we have this theorem: p is a prime if and only if all solutions of the equation sigma(p*x) = p*x + sigma(x) are powers of p. - Jahangeer Kholdi, Nov 23 2013
From Doug Bell, Jun 22 2015: (Start)
Empirical observation: Where n is an odd multiple of 3, let x = (a(n) + 1)/9 and let y be the decimal expansion of x/a(n); then y*(x+1)/x + 1 = y rotated to the left.
Example:
  a(3) = 125;
  x = (125 + 1)/9 = 14;
  y = 112, which is the decimal expansion of 14/125 = 0.112;
  112*(14 + 1)/14 + 1 = 121 = 112 rotated to the left.
(End)
a(n) is the number of n-digit integers that contain only odd digits (A014261). - Bernard Schott, Nov 12 2022
Number of pyramids in the Sierpinski fractal square-based pyramid at the n-th step, while A279511 gives the corresponding number of vertices (see IREM link with drawings). - Bernard Schott, Nov 29 2022

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
O. M. Cain, The Exceptional Selfcondensability of Powers of Five, arXiv:1910.13829 [math.HO], 2019.
Peter J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 270
IREM Paris-Nord, La pyramide de Sierpinski (in French).
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
Yash Puri and Thomas Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Eric Weisstein's World of Mathematics, Box Fractal
Index entries for linear recurrences with constant coefficients, signature (5).

Cf. A009969 (even bisection), A013710 (odd bisection), A005054 (first differences), A003463 (partial sums).
Cf. A006495, A006496, A159991, A001021.
Cf. A001076, A008776, A013620, A038220, A067497, A085449, A014261.
Sierpinski fractal square-based pyramid: A020858 (Hausdorff dimension), A279511 (number of vertices), this sequence (number of pyramids).

a000351 = (5 ^)
a000351_list = iterate (* 5) 1  -- Reinhard Zumkeller, Oct 31 2012

[5^n : n in [0..30]]; // Wesley Ivan Hurt, Sep 27 2016

[ seq(5^n,n=0..30) ];
A000351:=-1/(-1+5*z); # Simon Plouffe in his 1992 dissertation

Table[5^n, {n, 0, 30}] (* Stefan Steinerberger, Apr 06 2006 *)
5^Range[0, 30] (* Harvey P. Dale, Aug 22 2011 *)

makelist(5^n,n,0,20); /* Martin Ettl, Dec 27 2012 */

a(n)=5^n \\ Charles R Greathouse IV, Jun 10 2011

def a(n): return 5**n
print([a(n) for n in range(24)]) # Michael S. Branicky, Nov 12 2022

(List.fill(50)(5: BigInt)).scanLeft(1: BigInt)( * ) // Alonso del Arte, May 31 2019

a(n) = 5^n.
a(0) = 1; a(n) = 5*a(n-1) for n > 0.
G.f.: 1/(1 - 5*x).
E.g.f.: exp(5*x).
a(n) = A006495(n)^2 + A006496(n)^2.
a(n) = A159991(n) / A001021(n). - Reinhard Zumkeller, May 02 2009
From Bernard Schott, Nov 12 2022: (Start)
Sum_{n>=0} 1/a(n) = 5/4.
Sum_{n>=0} (-1)^n/a(n) = 5/6. (End)
a(n) = Sum_{k=0..n} C(2*n+1,n-k)*A000045(2*k+1). - Vladimir Kruchinin, Jan 14 2025

A374848 Obverse convolution A000045**A000045; see Comments.

Original entry on oeis.org

0, 1, 2, 16, 162, 3600, 147456, 12320100, 2058386904, 701841817600, 488286500625000, 696425232679321600, 2038348954317776486400, 12259459134020160144810000, 151596002479762016373851690400, 3855806813438155578522841251840000

Offset: 0

Clark Kimberling, Jul 31 2024

nonn

The obverse convolution of sequences
  s = (s(0), s(1), ...) and t = (t(0), t(1), ...)
is introduced here as the sequence s**t given by
s**t(n) = (s(0)+t(n)) * (s(1)+t(n-1)) * ... * (s(n)+t(0)).
Swapping * and + in the representation s(0)*t(n) + s(1)*t(n-1) + ... + s(n)*t(0)
of ordinary convolution yields s**t.
If x is an indeterminate or real (or complex) variable, then for every sequence t of real (or complex) numbers, s**t is a sequence of polynomials p(n) in x, and the zeros of p(n) are the numbers -t(0), -t(1), ..., -t(n).
Following are abbreviations in the guide below for triples (s, t, s**t):
F = (0,1,1,2,3,5,...) = A000045, Fibonacci numbers
L = (2,1,3,4,7,11,...) = A000032, Lucas numbers
P = (2,3,5,7,11,...) = A000040, primes
T = (1,3,6,10,15,...) = A000217, triangular numbers
C = (1,2,6,20,70, ...) = A000984, central binomial coefficients
LW = (1,3,4,6,8,9,...) = A000201, lower Wythoff sequence
UW = (2,5,7,10,13,...) = A001950, upper Wythoff sequence
[ ] = floor
In the guide below, sequences s**t are identified with index numbers Axxxxxx; in some cases, s**t and Axxxxxx differ in one or two initial terms.
Table 1. s = A000012 = (1,1,1,1...) = (1);
t = A000012; 1                 s**t = A000079; 2^(n+1)
t = A000027; n                 s**t = A000142; (n+1)!
t = A000040, P                 s**t = A054640
t = A000040, P           (1/3) s**t = A374852
t = A000079, 2^n               s**t = A028361
t = A000079, 2^n         (1/3) s**t = A028362
t = A000045, F                 s**t = A082480
t = A000032, L                 s**t = A374890
t = A000201, LW                s**t = A374860
t = A001950, UW                s**t = A374864
t = A005408, 2*n+1             s**t = A000165, 2^n*n!
t = A016777, 3*n+1             s**t = A008544
t = A016789, 3*n+2             s**t = A032031
t = A000142, n!                s**t = A217757
t = A000051, 2^n+1             s**t = A139486
t = A000225, 2^n-1             s**t = A006125
t = A032766, [3*n/2]           s**t = A111394
t = A034472, 3^n+1             s**t = A153280
t = A024023, 3^n-1             s**t = A047656
t = A000217, T                 s**t = A128814
t = A000984, C                 s**t = A374891
t = A279019, n^2-n             s**t = A130032
t = A004526, 1+[n/2]           s**t = A010551
t = A002264, 1+[n/3]           s**t = A264557
t = A002265, 1+[n/4]           s**t = A264635
Sequences (c)**L, for c=2..4: A374656 to A374661
Sequences (c)**F, for c=2..6: A374662, A374662, A374982 to A374855
The obverse convolutions listed in Table 1 are, trivially, divisibility sequences. Likewise, if s = (-1,-1,-1,...) instead of s = (1,1,1,...), then s**t is a divisibility sequence for every choice of t; e.g. if s = (-1,-1,-1,...) and t = A279019, then s**t = A130031.
Table 2. s = A000027 = (0,1,2,3,4,5,...) = (n);
t = A000027, n                 s**t = A007778, n^(n+1)
t = A000290, n^2               s**t = A374881
t = A000040, P                 s**t = A374853
t = A000045, F                 s**t = A374857
t = A000032, L                 s**t = A374858
t = A000079, 2^n               s**t = A374859
t = A000201, LW                s**t = A374861
t = A005408, 2*n+1             s**t = A000407, (2*n+1)! / n!
t = A016777, 3*n+1             s**t = A113551
t = A016789, 3*n+2             s**t = A374866
t = A000142, n!                s**t = A374871
t = A032766, [3*n/2]           s**t = A374879
t = A000217, T                 s**t = A374892
t = A000984, C                 s**t = A374893
t = A038608, n*(-1)^n          s**t = A374894
Table 3. s = A000290 = (0,1,4,9,16,...) = (n^2);
t = A000290, n^2               s**t = A323540
t = A002522, n^2+1             s**t = A374884
t = A000217, T                 s**t = A374885
t = A000578, n^3               s**t = A374886
t = A000079, 2^n               s**t = A374887
t = A000225, 2^n-1             s**t = A374888
t = A005408, 2*n+1             s**t = A374889
t = A000045, F                 s**t = A374890
Table 4. s = t;
s = t = A000012, 1             s**s = A000079; 2^(n+1)
s = t = A000027, n             s**s = A007778, n^(n+1)
s = t = A000290, n^2           s**s = A323540
s = t = A000045, F             s**s = this sequence
s = t = A000032, L             s**s = A374850
s = t = A000079, 2^n           s**s = A369673
s = t = A000244, 3^n           s**s = A369674
s = t = A000040, P             s**s = A374851
s = t = A000201, LW            s**s = A374862
s = t = A005408, 2*n+1         s**s = A062971
s = t = A016777, 3*n+1         s**s = A374877
s = t = A016789, 3*n+2         s**s = A374878
s = t = A032766, [3*n/2]       s**s = A374880
s = t = A000217, T             s**s = A375050
s = t = A005563, n^2-1         s**s = A375051
s = t = A279019, n^2-n         s**s = A375056
s = t = A002398, n^2+n         s**s = A375058
s = t = A002061, n^2+n+1       s**s = A375059
If n = 2*k+1, then s**s(n) is a square; specifically,
s**s(n) = ((s(0)+s(n))*(s(1)+s(n-1))*...*(s(k)+s(k+1)))^2.
If n = 2*k, then s**s(n) has the form 2*s(k)*m^2, where m is an integer.
Table 5. Others
s = A000201, LW      t = A001950, UW         s**t = A374863
s = A000045, F       t = A000032, L          s**t = A374865
s = A005843, 2*n     t = A005408, 2*n+1      s**t = A085528, (2*n+1)^(n+1)
s = A016777, 3*n+1   t = A016789, 3*n+2      s**t = A091482
s = A005408, 2*n+1   t = A000045, F          s**t = A374867
s = A005408, 2*n+1   t = A000032, L          s**t = A374868
s = A005408, 2*n+1   t = A000079, 2^n        s**t = A374869
s = A000027, n       t = A000142, n!         s**t = A374871
s = A005408, 2*n+1   t = A000142, n!         s**t = A374872
s = A000079, 2^n     t = A000142, n!         s**t = A374874
s = A000142, n!      t = A000045, F          s**t = A374875
s = A000142, n!      t = A000032, L          s**t = A374876
s = A005408, 2*n+1   t = A016777, 3*n+1      s**t = A352601
s = A005408, 2*n+1   t = A016789, 3*n+2      s**t = A064352
Table 6. Arrays of coefficients of s(x)**t(x), where s(x) and t(x) are polynomials
s(x)              t(x)            s(x)**t(x)
 n                 x              A132393
n^2                x              A269944
x+1               x+1             A038220
x+2               x+2             A038244
 x                x+3             A038220
nx                x+1             A094638
 1              x^2+x+1           A336996
n^2 x             x+1             A375041
n^2 x            2x+1             A375042
n^2 x             x+2             A375043
2^n x             x+1             A375044
2^n              2x+1             A375045
2^n              x+2              A375046
x+1              F(n)             A375047
x+1             x+F(n)            A375048
x+F(n)          x+F(n)            A375049

			a(0) = 0 + 0 = 0
a(1) = (0+1) * (1+0) = 1
a(2) = (0+1) * (1+1) * (1+0) = 2
a(3) = (0+2) * (1+1) * (1+1) * (2+0) = 16
As noted above, a(2*k+1) is a square for k>=0. The first 5 squares are 1, 16, 3600, 12320100, 701841817600, with corresponding square roots 1, 4, 60, 3510, 837760.
If n = 2*k, then s**s(n) has the form 2*F(k)*m^2, where m is an integer and F(k) is the k-th Fibonacci number; e.g., a(6) = 2*F(3)*(192)^2.

Cf. A000045, A374850-to-A374881, A374884-to-A374894, A375041-to-A375049.

a:= n-> (F-> mul(F(n-j)+F(j), j=0..n))(combinat[fibonacci]):
seq(a(n), n=0..15);  # Alois P. Heinz, Aug 02 2024

s[n_] := Fibonacci[n]; t[n_] := Fibonacci[n];
u[n_] := Product[s[k] + t[n - k], {k, 0, n}];
Table[u[n], {n, 0, 20}]

a(n)=prod(k=0, n, fibonacci(k) + fibonacci(n-k)) \\ Andrew Howroyd, Jul 31 2024

a(n) ~ c * phi^(3*n^2/4 + n) / 5^((n+1)/2), where c = QPochhammer(-1, 1/phi^2)^2/2 if n is even and c = phi^(1/4) * QPochhammer(-phi, 1/phi^2)^2 / (phi + 1)^2 if n is odd, and phi = A001622 is the golden ratio. - Vaclav Kotesovec, Aug 01 2024

A013620 Triangle of coefficients in expansion of (2+3x)^n.

Original entry on oeis.org

1, 2, 3, 4, 12, 9, 8, 36, 54, 27, 16, 96, 216, 216, 81, 32, 240, 720, 1080, 810, 243, 64, 576, 2160, 4320, 4860, 2916, 729, 128, 1344, 6048, 15120, 22680, 20412, 10206, 2187, 256, 3072, 16128, 48384, 90720, 108864, 81648, 34992, 6561, 512

Offset: 0

N. J. A. Sloane

Row sums give A000351; central terms give A119309. - Reinhard Zumkeller, May 14 2006

			Triangle begins:
1;
2,3;
4,12,9;
8,36,54,27;
16,96,216,216,81;

Reinhard Zumkeller, Rows n = 0..125 of triangle, flattened
Gábor Kallós, A generalization of Pascal’s triangle using powers of base numbers, Annales mathématiques Blaise Pascal, 13 no. 1 (2006), p. 1-15.
Index entries for triangles and arrays related to Pascal's triangle

Cf. A038220, A000079, A000244, A013613.

a013620 n k = a013620_tabl !! n !! k
a013620_row n = a013620_tabl !! n
a013620_tabl = iterate (\row ->
   zipWith (+) (map (* 2) (row ++ [0])) (map (* 3) ([0] ++ row))) [1]
-- Reinhard Zumkeller, May 26 2013, Apr 02 2011

Flatten[Table[Binomial[i, j] 2^(i-j) 3^j, {i, 0, 10}, {j, 0, i}]] (* Vincenzo Librandi, Apr 22 2014 *)

G.f.: 1 / [1 - x(2+3y)].

T(n,k) = A007318(n,k) * A036561(n,k). - Reinhard Zumkeller, May 14 2006

A303901 Triangle read by rows of coefficients in expansion of (3-2x)^n, where n is a nonnegative integer.

Original entry on oeis.org

1, 3, -2, 9, -12, 4, 27, -54, 36, -8, 81, -216, 216, -96, 16, 243, -810, 1080, -720, 240, -32, 729, -2916, 4860, -4320, 2160, -576, 64, 2187, -10206, 20412, -22680, 15120, -6048, 1344, -128, 6561, -34992, 81648, -108864, 90720, -48384, 16128, -3072, 256, 19683, -118098, 314928, -489888, 489888, -326592, 145152, -41472, 6912, -512

Offset: 0

Zagros Lalo, May 02 2018

This is a signed version of A038220.
Row n gives coefficients in expansion of (3-2x)^n.
The numbers in rows of triangles in A302747 and A303941 are along skew diagonals pointing top-left and top-right in center-justified triangle of coefficients in expansions of (3-2x)^n (A303901).
This is the lower triangular Riordan matrix (1/(1-3*t), -2*t/(1-3*t)), hence a convolution matrix. See the g.f.s. - Wolfdieter Lang, Jun 28 2018

			Triangle begins:
  n \k 0     1       2       3      4      5       6      7      8    9  ...
  --------------------------------------------------------------------------
  0 |  1
  1 |  3     -2
  2 |  9     -12     4
  3 |  27    -54     36     -8
  4 |  81    -216    216    -96     16
  5 |  243   -810    1080   -720    240    -32
  6 |  729   -2916   4860   -4320   2160   -576    64
  7 |  2187  -10206  20412  -22680  15120  -6048   1344   -128
  8 |  6561  -34992  81648  -108864 90720  -48384  16128  -3072  256
  9 |  19683 -118098 314928 -489888 489888 -326592 145152 -41472 6912 -512

Shara Lalo and Zagros Lalo, Polynomial Expansion Theorems and Number Triangles, Zana Publishing, 2018, ISBN: 978-1-9995914-0-3, pp. 394, 396, 398.

Zagros Lalo, Center-justified Triangle
Zagros Lalo, Skew Diagonals in center-justified Triangle

Cf. A013620 (unsigned), A000012 (row sums), A000351 (alternating row sums).

For[i = 0, i < 4, i++, Print[CoefficientList[Expand[(3 - 2 x)^i],x]]]

T(0,0) = 1; T(n,k) = 3*T(n-1,k) - 2*T(n-1,k-1) for k = 0,1,...,n; T(n,k)=0 for n or k < 0.
G.f. of row polynomials: 1 / (1 - 3*t + 2*t*x).
G.f. of column k: (-2*x)^k/(1-3*x)^(k+1), for k >= 0.

Edited - Wolfdieter Lang, Jun 28 2018

A119309 a(n) = binomial(2n,n) 6^n.

Original entry on oeis.org

1, 12, 216, 4320, 90720, 1959552, 43110144, 960740352, 21616657920, 489977579520, 11171488813056, 255928652808192, 5886359014588416, 135839054182809600, 3143703825373593600, 72933928748667371520

Offset: 0

Reinhard Zumkeller, May 14 2006

nonn

Number of lattice paths from (0,0) to (n,n) using three kinds of steps (1,0) and two kinds of steps (0,1). - Joerg Arndt, Jul 01 2011

Central terms of the triangles in A013620 and A038220.

			a(3) = binomial(2*3,3) * (6^3) = 20 * 216 = 4320. - _Indranil Ghosh_, Mar 03 2017

Indranil Ghosh, Table of n, a(n) for n = 0..400
Hacène Belbachir and Abdelghani Mehdaoui, Recurrence relation associated with the sums of square binomial coefficients, Quaestiones Mathematicae (2021) Vol. 44, Issue 5, 615-624.

Cf. A000984, A013620, A038220, A059304, A098658.

Table[Binomial[2n,n]*(6^n), {n, 0, 15}] (* Indranil Ghosh, Mar 03 2017 *)

/* same as in A092566 but use */
steps=[[1,0], [1,0], [1,0], [0,1], [0,1]]; /* note repeated entries */
/* Joerg Arndt, Jun 30 2011 */

a(n)=binomial(2*n,n)*6^n \\ Charles R Greathouse IV, Mar 03 2017

import math
f=math.factorial
def C(n,r): return f(n)//f(r)//f(n-r)
def A119309(n): return C(2*n,n)*(6**n) # Indranil Ghosh, Mar 03 2017

a(n) = 6^n * A000984(n).
G.f.: 1/sqrt(1-24*x). - Zerinvary Lajos, Dec 20 2008 [Corrected by Joerg Arndt, Jul 01 2011]
D-finite with recurrence: n*a(n) +12*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Jan 20 2020
a(n) = 2^n*A098658(n) = 3^n*A059304(n). - R. J. Mathar, Jan 20 2020
From Amiram Eldar, Jul 21 2020: (Start)
Sum_{n>=0} 1/a(n) = 24/23 + 24*sqrt(23)*arcsin(1/sqrt(24))/529.
Sum_{n>=0} (-1)^n/a(n) = 24/25 - 24*arcsinh(1/sqrt(24))/125. (End)
E.g.f.: exp(12*x) * BesselI(0,12*x). - Ilya Gutkovskiy, Sep 14 2021

A123187 Triangle of coefficients in expansion of (1+13x)^n.

Original entry on oeis.org

1, 1, 13, 1, 26, 169, 1, 39, 507, 2197, 1, 52, 1014, 8788, 28561, 1, 65, 1690, 21970, 142805, 371293, 1, 78, 2535, 43940, 428415, 2227758, 4826809, 1, 91, 3549, 76895, 999635, 7797153, 33787663, 62748517, 1, 104, 4732, 123032, 1999270, 20792408

Offset: 1

Roger L. Bagula and Gary W. Adamson, Oct 03 2006

T(n,k) equals the number of n-length words on {0,1,...,13} having n-k zeros. - Milan Janjic, Jul 24 2015

			1
1, 13
1, 26, 169
1, 39, 507, 2197
1, 52, 1014, 8788, 28561
1, 65, 1690, 21970, 142805, 371293

Cf. A013609, A013610, A013611, A013621, A038220, A038222.

T:= n-> (p-> seq(coeff(p, x, k), k=0..n))((1+13*x)^n):
seq(T(n), n=0..10);  # Alois P. Heinz, Jul 24 2015

p[0, x] = 1; p[1, x] = 13*x + 1; p[k_, x_] := p[k, x] = (13*x + 1)*p[k - 1, x]; w = Table[CoefficientList[p[n, x], x], {n, 0, 10}]; Flatten[w]

p(k, x) = (13*x + 1)*p(k - 1, x).

T(n,k) = 13^k*C(n,k) = Sum_{i=n-k..n} C(i,n-k)*C(n,i)*12^(n-i). Row sums are 14^n = A001023. G.f.: 1 / [1 - x(1+13y)]. - Mircea Merca, Apr 28 2012

cp's OEIS Frontend

A000351 Powers of 5: a(n) = 5^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Python

Scala

Formula

A374848 Obverse convolution A000045**A000045; see Comments.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A013620 Triangle of coefficients in expansion of (2+3x)^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A303901 Triangle read by rows of coefficients in expansion of (3-2x)^n, where n is a nonnegative integer.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A119309 a(n) = binomial(2*n,n) * 6^n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A123187 Triangle of coefficients in expansion of (1+13x)^n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A119309 a(n) = binomial(2n,n) 6^n.