cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 13 results. Next

A113089 Number of 3-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 2) and t_{i+1} <= 3*t_i for 1

Original entry on oeis.org

1, 2, 10, 114, 2970, 182402, 27392682, 10390564242, 10210795262650, 26494519967902114, 184142934938620227530, 3466516611360924222460082, 178346559667060145108789818842, 25264074391478558474014952210052802
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Column 0 of triangle A113088; A113088 is the matrix square of triangle A113084, which satisfies the matrix recurrence: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k). Also equals column 2 of square table A113081.

Examples

			The tree of 3-tournament sequences of even integer
descendents of a node labeled (2) begins:
[2]; generation 1: 2->[4,6];
generation 2: 4->[6,8,10,12], 6->[8,10,12,14,16,18]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^3)[r-1,c-1])+(M^3)[r-1,c]))); return((M^2)[n+1,1])}

A113100 Number of 4-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 3 and t_i = 3 (mod 3) and t_{i+1} <= 4*t_i for 1

Original entry on oeis.org

1, 3, 27, 693, 52812, 12628008, 9924266772, 26507035453923, 246323730279500082, 8100479557816637139288, 954983717308947379891713642, 407790020849346203244152231395953
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Column 0 of triangle A113099; A113099 is the matrix cube of triangle A113095, which satisfies the matrix recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k). Also equals column 3 of square table A113092.

Examples

			The tree of 4-tournament sequences of descendents of a node labeled (3) begins:
[3]; generation 1: 3->[6,9,12]; generation 2:
6->[9,12,15,18,21,24], 9->[12,15,18,21,24,27,30,33,36],
12->[15,18,21,24,27,30,33,36,39,42,45,48]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^4)[r-1,c-1])+(M^4)[r-1,c]))); return((M^3)[n+1,1])}

A113113 Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 4 and t_i = 4 (mod 4) and t_{i+1} <= 5*t_i for 1

Original entry on oeis.org

1, 4, 56, 2704, 481376, 337587520, 978162377600, 12088945462984960, 651451173346940188160, 155573037664478034394215424, 166729581953452524706695313356800
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Column 0 of triangle A113112; A113112 is the matrix 4th power of triangle A113106, which satisfies the matrix recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k). Also equals column 4 of square table A113103.

Examples

			The tree of 5-tournament sequences of descendents
of a node labeled (4) begins:
[4]; generation 1: 4->[8,12,16,20];
generation 2: 8->[12,16,20,24,28,32,36,40],
12->[16,20,24,28,32,36,40,44,48,52,56,60],
16->[20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80],
20->[24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100];
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^5)[r-1,c-1])+(M^5)[r-1,c]))); return((M^4)[n+1,1])}

A113096 Number of 4-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 1 and t_i = 1 (mod 3) and t_{i+1} <= 4*t_i for 1

Original entry on oeis.org

1, 1, 4, 46, 1504, 146821, 45236404, 46002427696, 159443238441379, 1926751765436372746, 82540801108546193896804, 12696517688186899788062326096, 7084402815778394692932546017050054
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 0 of triangle A113095, which satisfies: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).

Examples

			The tree of 4-tournament sequences of descendents
of a node labeled (1) begins:
[1]; generation 1: 1->[4]; generation 2: 4->[7,10,13,16];
generation 3: 7->[10,13,16,19,22,25,28],
10->[13,16,19,22,25,28,31,34,37,40],
13->[16,19,22,25,28,31,34,37,40,43,46,49,52],
16->[19,22,25,28,31,34,37,40,43,46,49,52,55,58,61,64]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^4)[r-1,c-1])+(M^4)[r-1,c]))); return(M[n+1,1])}

A113107 Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 1 and t_i = 1 (mod 4) and t_{i+1} <= 5*t_i for 1

Original entry on oeis.org

1, 1, 5, 85, 4985, 1082905, 930005021, 3306859233805, 50220281721033905, 3328966349792343354865, 978820270264589718999911669, 1292724512951963810375572954693765
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 0 of triangle A113106 which satisfies recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k), where A113106^5 is the matrix 5th power.

Examples

			The tree of 5-tournament sequences of descendents
of a node labeled (1) begins:
[1]; generation 1: 1->[5]; generation 2: 5->[9,13,17,21,25]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^5)[r-1,c-1])+(M^5)[r-1,c]))); return(M[n+1,1])}

A113078 Number of tournament sequences: a(n) gives the number of n-th generation descendents of a node labeled (4) in the tree of tournament sequences.

Original entry on oeis.org

1, 4, 26, 274, 4721, 134899, 6501536, 537766009, 77598500096, 19821981700354, 9077118324755246, 7531446638893873684, 11423775838657143826346, 31914367054676982206368909, 165251261153335414813452988541
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 4 of square table A093729. Also equals column 0 of the matrix 4th power of triangle A097710, which satisfies the matrix recurrence: A097710(n,k) = [A097710^2](n-1,k-1) + [A097710^2](n-1,k) for n>k>=0.

Examples

			The tree of tournament sequences of descendents of a node labeled (4) begins:
[4]; generation 1: 4->[5,6,7,8]; generation 2: 5->[6,7,8,9,10],
6->[7,8,9,10,11,12], 7->[8,9,10,11,12,13,14],
8->[9,10,11,12,13,14,15,16]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n,q=2)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^q)[r-1,c-1])+(M^q)[r-1,c]))); return((M^4)[n+1,1])}

A113079 Number of tournament sequences: a(n) gives the number of n-th generation descendents of a node labeled (5) in the tree of tournament sequences.

Original entry on oeis.org

1, 5, 40, 515, 10810, 376175, 22099885, 2231417165, 393643922005, 123097221805100, 69087264010363930, 70321483026073531730, 130954011392485408662370, 449450774746306949114288795
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 5 of square table A093729. Also equals column 0 of the matrix 5th power of triangle A097710, which satisfies the matrix recurrence: A097710(n,k) = [A097710^2](n-1,k-1) + [A097710^2](n-1,k) for n>k>=0.

Examples

			The tree of tournament sequences of descendents of a node labeled (5) begins:
[5]; generation 1: 5->[6,7,8,9,10]; generation 2:
6->[7,8,9,10,11,12], 7->[8,9,10,11,12,13,14],
8->[9,10,11,12,13,14,15,16], 9->[10,11,12,13,14,15,16,17,18],
10->[11,12,13,14,15,16,17,18,19,20]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n,q=2)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^q)[r-1,c-1])+(M^q)[r-1,c]))); return((M^5)[n+1,1])}

A113109 Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 2 and t_i = 2 (mod 4) and t_{i+1} <= 5*t_i for 1

Original entry on oeis.org

1, 2, 16, 440, 43600, 16698560, 26098464448, 172513149018752, 4938593053649344000, 622793203804403960906240, 350552003258337075784341271552, 890153650520295355798989668668129280
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 0 of triangle A113108, which is the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).

Examples

			The tree of 5-tournament sequences of descendents
of a node labeled (2) begins:
[2]; generation 1: 2->[6,10]; generation 2:
6->[10,14,18,22,26,30], 10->[14,18,22,26,30,34,38,42,46,50]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^5)[r-1,c-1])+(M^5)[r-1,c]))); return((M^2)[n+1,1])}

A113111 Number of 5-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 3 and t_i = 3 (mod 4) and t_{i+1} <= 5*t_i for 1

Original entry on oeis.org

1, 3, 33, 1251, 173505, 94216515, 210576669921, 2002383115518243, 82856383278525698433, 15166287556997012904054915, 12437232461209961704387810340769
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 0 of triangle A113110, which is the matrix cube of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).

Examples

			The tree of 5-tournament sequences of descendents
of a node labeled (3) begins:
[3]; generation 1: 3->[7,11,15];
generation 2: 7->[11,15,19,23,27,31,35],
11->[15,19,23,27,31,35,39,43,47,51,55],
15->[19,23,27,31,35,39,43,47,51,55,59,63,67,71,75]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^5)[r-1,c-1])+(M^5)[r-1,c]))); return((M^3)[n+1,1])}

A113085 Number of 3-tournament sequences: a(n) gives the number of increasing sequences of n positive integers (t_1,t_2,...,t_n) such that t_1 = 1 and t_i = 1 (mod 2) and t_{i+1} <= 3*t_i for 1

Original entry on oeis.org

1, 1, 3, 21, 331, 11973, 1030091, 218626341, 118038692523, 166013096151621, 619176055256353291, 6207997057962300681573, 169117528577725378851523691, 12626174170113987651028630856581, 2602022118010488151483064379958957003
Offset: 0

Views

Author

Paul D. Hanna, Oct 14 2005

Keywords

Comments

Equals column 0 of triangle A113084, which satisfies: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k).

Examples

			The tree of 3-tournament sequences of odd integer
descendents of a node labeled (1) begins:
[1]; generation 1: 1->[3]; generation 2: 3->[5,7,9];
generation 3: 5->[7,9,11,13,15], 7->[9,11,13,15,17,19,21],
9->[11,13,15,17,19,21,23,25,27]; ...
Then a(n) gives the number of nodes in generation n.
Also, a(n+1) = sum of labels of nodes in generation n.
		

Crossrefs

Programs

  • PARI
    {a(n)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^3)[r-1,c-1])+(M^3)[r-1,c]))); return(M[n+1,1])}
Showing 1-10 of 13 results. Next