A052963 -id:A052963 - cp's OEIS frontend

A274453 Products of distinct numbers in A052963.

2, 5, 10, 14, 28, 40, 70, 80, 115, 140, 200, 230, 331, 400, 560, 575, 662, 953, 1120, 1150, 1610, 1655, 1906, 2744, 2800, 3220, 3310, 4600, 4634, 4765, 5488, 5600, 7901, 8050, 9200, 9268, 9530, 13240, 13342, 13720, 15802, 16100, 22750, 23000, 23170, 26480

Offset: 1

Clark Kimberling, Jun 23 2016

			The numbers in A274453 are 1, 2, 5, 14, 40, 115, 331,..., so that the sequence of all products of distinct members, in increasing order, is (2, 5, 10, 14, 28, 40, 70, 80,...).

Clark Kimberling, Table of n, a(n) for n = 1..10000

Cf. A160009, A274280, A274432, A274452.

r[1] := 1; r[2] := 1; r[3] = 1; r[n_] := r[n] = 3 r[n - 1] - r[n - 3]
s = {1}; z = 30; f = Map[r, Range[z]]; Take[f, 20] (* A052963 *)
Do[s = Union[s, Select[s*f[[i]], # <= f[[z]] &]], {i, z}];
Take[s, 2 z]  (* A274453 *)

A120747 Sequence relating to the 11-gon (or hendecagon).

Original entry on oeis.org

0, 1, 4, 14, 50, 175, 616, 2163, 7601, 26703, 93819, 329615, 1158052, 4068623, 14294449, 50221212, 176444054, 619907431, 2177943781, 7651850657, 26883530748, 94450905714, 331837870408, 1165858298498, 4096053203771, 14390815650209, 50559786403254

Offset: 1

Gary W. Adamson, Jul 01 2006

The hendecagon is an 11-sided polygon. The preferred word in the OEIS is 11-gon.
The lengths of the diagonals of the regular 11-gon are r[k] = sin(k*Pi/11)/sin(Pi/11), 1 <= k <= 5, where r[1] = 1 is the length of the edge.
The value of limit(a(n)/a(n-1),n=infinity) equals the longest diagonal r[5].
The a(n) equal the matrix elements M^n[1,2], where M = Matrix([[1,1,1,1,1], [1,1,1,1,0], [1,1,1,0,0], [1,1,0,0,0], [1,0,0,0,0]]). The characteristic polynomial of M is (x^5 - 3x^4 - 3x^3 + 4x^2 + x - 1) with roots x1 = -r[4]/r[3], x2 = -r[2]/r[4], x3 = r[1]/r[2], x4 = r[3]/r[5] and x5 = r[5]/r[1].
Note that M^4*[1,0,0,0,0] = [55, 50, 41, 29, 15] which are all terms of the 5-wave sequence A038201. This is also the case for the terms of M^n*[1,0,0,0,0], n>=1.

			From _Johannes W. Meijer_, Aug 03 2011: (Start)
The lengths of the regular hendecagon edge and diagonals are:
  r[1] = 1.000000000, r[2] = 1.918985948, r[3] = 2.682507066,
  r[4] = 3.228707416, r[5] = 3.513337092.
The first few rows of the T(n,k) array are, n>=1, 1 <= k <=5:
    0,   0,   0,   0,   1, ...
    1,   1,   1,   1,   1, ...
    1,   2,   3,   4,   5, ...
    5,   9,  12,  14,  15, ...
   15,  29,  41,  50,  55, ...
   55, 105, 146, 175, 190, ...
  190, 365, 511, 616, 671, ... (End)

G. C. Greubel, Table of n, a(n) for n = 1..1000
Jay Kappraff, Slavik Jablan, Gary W. Adamson and Radmila Sazdanovich, Golden Fields, Generalized Fibonacci Sequences and Chaotic Matrices, Forma, Vol. 19 No. 4, pp. 367-387, 2004.
P. Steinbach, Golden fields: a case for the heptagon, Math. Mag. 70 (1997), no. 1, 22-31, MR 1439165
Eric Weisstein's World of Mathematics, Hendecagon.
Index entries for linear recurrences with constant coefficients, signature (3,3,-4,-1,1).

Cf. A006358, A033304, A038201, A052963, A065941, A066170.
From Johannes W. Meijer, Aug 03 2011: (Start)
Cf. A006358 (T(n+2,1) and T(n+1,5)), A069006 (T(n+1,2)), A038342 (T(n+1,3)), this sequence (T(n,4)) (m=5: hendecagon or 11-gon).
Cf. A000045 (m=2; pentagon or 5-gon); A006356, A006054 and A038196 (m=3: heptagon or 7-gon); A006357, A076264, A091024 and A038197 (m=4: enneagon or 9-gon); A006359, A069007, A069008, A069009, A070778 (m=6; tridecagon or 13-gon); A025030 (m=7: pentadecagon or 15-gon); A030112 (m=8: heptadecagon or 17-gon). (End)

R:=PowerSeriesRing(Integers(), 40); [0] cat Coefficients(R!( x^2*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5) )); // G. C. Greubel, Nov 13 2022

nmax:=27: m:=5: for k from 1 to m-1 do T(1,k):=0 od: T(1,m):=1: for n from 2 to nmax do for k from 1 to m do T(n,k):= add(T(n-1,k1), k1=m-k+1..m) od: od: for n from 1 to nmax/3 do seq(T(n,k), k=1..m) od; for n from 1 to nmax do a(n):=T(n,4) od: seq(a(n), n=1..nmax); # Johannes W. Meijer, Aug 03 2011

LinearRecurrence[{3, 3, -4, -1, 1}, {0, 1, 4, 14, 50}, 41] (* G. C. Greubel, Nov 13 2022 *)

def A120747_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( x*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5) ).list()
A120747_list(40) # G. C. Greubel, Nov 13 2022

a(n) = 3*a(n-1) + 3*a(n-2) - 4*a(n-3) - a(n-4) + a(n-5).
G.f.: x^2*(1+x-x^2)/(1-3*x-3*x^2+4*x^3+x^4-x^5). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009
From Johannes W. Meijer, Aug 03 2011: (Start)
a(n) = T(n,4) with T(n,k) = Sum_{k1 = 6-k..6} T(n-1, k1), T(1,1) = T(1,2) = T(1,3) = T(1,4) = 0 and T(1,5) = 1, n>=1 and 1 <= k <= 5. [Steinbach]
Sum_{k=1..5} T(n,k)*r[k] = r[5]^n, n>=1. [Steinbach]
r[k] = sin(k*Pi/11)/sin(Pi/11), 1 <= k <= 5. [Kappraff]
Sum_{k=1..5} T(n,k) = A006358(n-1).
Limit_{n -> 00} T(n,k)/T(n-1,k) = r[5], 1 <= k <= 5.
sequence(sequence( T(n,k), k=2..5), n>=1) = A038201(n-4).
G.f.: (x^2*(x - x1)*(x - x2))/((x - x3)*(x - x4)*(x - x5)*(x - x6)*(x - x7)) with x1 = phi, x2 = (1-phi), x3 = r[1] - r[3], x4 = r[3] - r[5], x5 = r[5] - r[4], x6 = r[4] - r[2], x7 = r[2], where phi = (1 + sqrt(5))/2 is the golden ratio A001622. (End)

Edited and information added by Johannes W. Meijer, Aug 03 2011

A190215 Riordan matrix ((1-x-x^2)/(1-2x-x^2),(x-x^2-x^3)/(1-2x-x^2)).

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 5, 5, 3, 1, 12, 14, 9, 4, 1, 29, 38, 28, 14, 5, 1, 70, 102, 84, 48, 20, 6, 1, 169, 271, 246, 157, 75, 27, 7, 1, 408, 714, 707, 496, 265, 110, 35, 8, 1, 985, 1868, 2001, 1526, 896, 417, 154, 44, 9, 1, 2378, 4858, 5592, 4596, 2930, 1500, 623, 208, 54, 10, 1, 5741, 12569, 15461, 13602, 9330, 5186, 2373, 894, 273, 65, 11, 1

Offset: 0

Emanuele Munarini, May 10 2011

Row sums = A052963.
Diagonal sums = A052960.
Central coefficients = A190315.

			Triangle begins:
    1;
    1,   1;
    2,   2,   1;
    5,   5,   3,   1;
   12,  14,   9,   4,   1;
   29,  38,  28,  14,   5,   1;
   70, 102,  84,  48,  20,   6,   1;
  169, 271, 246, 157,  75,  27,   7,   1;
  408, 714, 707, 496, 265, 110,  35,   8,   1;

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Cf. A052963, A052960, A190315.

Flatten[Table[Sum[Binomial[i+k,k]Sum[Binomial[i+j-1,j]Binomial[j,n-k-i-j],{j,0,n-k-i}],{i,0,n-k}],{n,0,12},{k,0,n}]]

create_list(sum(binomial(i+k,k)*sum(binomial(i+j-1,j)*binomial(j,n-k-i-j),j,0,n-k-i),i,0,n-k),n,0,12,k,0,n);

for(n=0,10, for(k=0,n, print1(sum(j=0,n-k, binomial(j+k,k)* sum(r=0,n-k-j, binomial(j+r-1,r)*binomial(r,n-k-j-r))), ", "))) \\ G. C. Greubel, Dec 27 2017

T(n,k) = Sum_{i=0..n-k} (binomial(i+k,k)*Sum_{j=0..n-k-i} (binomial(i+j-1,j)*binomial(j,n-k-i-j) )).

Recurrence: T(n+3,k+1) = 2 T(n+2,k+1) + T(n+2,k) + T(n+1,k+1) - T(n+1,k) - T(n,k).

cp's OEIS Frontend

A274453 Products of distinct numbers in A052963.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A120747 Sequence relating to the 11-gon (or hendecagon).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

SageMath

Formula

Extensions

A190215 Riordan matrix ((1-x-x^2)/(1-2x-x^2),(x-x^2-x^3)/(1-2x-x^2)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Maxima

PARI

Formula