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 14 results. Next

A208510 Triangle of coefficients of polynomials u(n,x) jointly generated with A029653; see the Formula section.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 4, 1, 1, 7, 9, 5, 1, 1, 9, 16, 14, 6, 1, 1, 11, 25, 30, 20, 7, 1, 1, 13, 36, 55, 50, 27, 8, 1, 1, 15, 49, 91, 105, 77, 35, 9, 1, 1, 17, 64, 140, 196, 182, 112, 44, 10, 1, 1, 19, 81, 204, 336, 378, 294, 156, 54, 11, 1, 1, 21, 100, 285, 540, 714, 672, 450, 210, 65, 12, 1
Offset: 1

Views

Author

Clark Kimberling, Feb 28 2012

Keywords

Comments

Row sums: A083329
Alternating row sums: 1,0,-1,-1,-1,-1,-1,-1,-1,-1,...
Antidiagonal sums: A000071 (-1+Fibonacci numbers)
col 1: A000012
col 2: A005408
col 3: A000290
col 4: A000330
col 5: A002415
col 6: A005585
col 7: A040977
col 8: A050486
col 9: A053347
col 10: A054333
col 11: A054334
col 12: A057788
col 2n-1 of A208510 is column n of A208508
col 2n of A208510 is column n of A208509.
...
GENERAL DISCUSSION:
A208510 typifies arrays generated by paired recurrence equations of the following form:
u(n,x)=a(n,x)*u(n-1,x)+b(n,x)*v(n-1,x)+c(n,x)
v(n,x)=d(n,x)*u(n-1,x)+e(n,x)*v(n-1,x)+f(n,x).
...
These first-order recurrences imply separate second-order recurrences. In order to show them, the six functions a(n,x),...,f(n,x) are abbreviated as a,b,c,d,e,f.
Then, starting with initial values u(1,x)=1 and u(2,x)=a+b+c: u(n,x) = (a+e)u(n-1,x) + (bd-ae)u(n-2,x) + bf-ce+c.
With initial values v(1,x)=1 and v(2,x)=d+e+f: v(n,x) = (a+e)v(n-1,x) + (bd-ae)v(n-2,x) + cd-af+f.
...
In the guide below, the last column codes certain sequences that occur in one of these ways: row, column, edge, row sum, alternating row sum. Coding:
A: 1,-1,1,-1,1,-1,1.... A033999
B: 1,2,4,8,16,32,64,... powers of 2
C: 1,1,1,1,1,1,1,1,.... A000012
D: 2,2,2,2,2,2,2,2,.... A007395
E: 2,4,6,8,10,12,14,... even numbers
F: 1,1,2,3,5,8,13,21,.. Fibonacci numbers
N: 1,2,3,4,5,6,7,8,.... A000027
O: 1,3,5,7,9,11,13,.... odd numbers
P: 1,3,9,27,81,243,.... powers of 3
S: 1,4,9,16,25,36,49,.. squares
T: 1,3,6,10,15,21,38,.. triangular numbers
Z: 1,0,0,0,0,0,0,0,0,.. A000007
*: (eventually) periodic alternating row sums
^: has a limiting row; i.e., the polynomials "approach" a power series
This coding includes indirect and repeated occurrences; e.g. F occurs thrice at A094441: in column 1 directly as Fibonacci numbers, in row sums as odd-indexed Fibonacci numbers, and in alternating row sums as signed Fibonacci numbers.
......... a....b....c....d....e....f....code
A034839 u 1....1....0....1....x....0....CCOT
A034867 v 1....1....0....1....x....0....CEN
A210221 u 1....1....0....1....2x...0....BBFF
A210596 v 1....1....0....1....2x...0....BBFF
A105070 v 1....2x...0....1....1....0....BN
A207605 u 1....1....0....1....x+1..0....BCFFN
A106195 v 1....1....0....1....x+1..0....BCFFN
A207606 u 1....1....0....x....x+1..0....DNT
A207607 v 1....1....0....x....x+1..0....DNT
A207608 u 1....1....0....2x...x+1..0....N
A207609 v 1....1....0....2x...x+1..0....C
A207610 u 1....1....0....1....x....1....CF
A207611 v 1....1....0....1....x....1....BCF
A207612 u 1....1....0....1....2x...1....BF
A207613 v 1....1....0....1....2x...1....BF
A207614 u 1....1....0....1....x+1..1....CN
A207615 v 1....1....0....1....x+1..1....CFN
A207616 u 1....1....0....x....1....1....CE
A207617 v 1....1....0....x....1....1....CNO
A029638 u 1....1....0....x....x....1....CDNO
A029635 v 1....1....0....x....x....1....CDNOZ
A207618 u 1....1....0....x....2x...1....N
A207619 v 1....1....0....x....2x...1....CFN
A207620 u 1....1....0....x....x+1..1....DET
A207621 v 1....1....0....x....x+1..1....DNO
A207622 u 1....1....0....2x...1....1....BT
A207623 v 1....1....0....2x...1....1....BN
A207624 u 1....1....0....2x...x....1....N
A102662 v 1....1....0....2x...x....1....CO
A207625 u 1....1....0....2x...x+1..1....T
A207626 v 1....1....0....2x...x+1..1....N
A207627 u 1....1....0....2x...2x...1....BN
A207628 v 1....1....0....2x...2x...1....BCE
A207629 u 1....1....0....x+1..1....1....CET
A207630 v 1....1....0....x+1..1....1....CO
A207631 u 1....1....0....x+1..x....1....DF
A207632 v 1....1....0....x+1..x....1....DEF
A207633 u 1....1....0....x+1..2x...1....F
A207634 v 1....1....0....x+1..2x...1....F
A207635 u 1....1....0....x+1..x+1..1....DN
A207636 v 1....1....0....x+1..x+1..1....CD
A160232 u 1....x....0....1....2x...0....BCFN
A208341 v 1....x....0....1....2x...0....BCFFN
A085478 u 1....x....0....1....x+1..0....CCOFT*
A078812 v 1....x....0....1....x+1..0....CEFN*
A208342 u 1....x....0....x....x....0....CCFNO
A208343 v 1....x....0....x....x....0....BBCDFZ
A208344 u 1....x....0....x....2x...0....CCFN
A208345 v 1....x....0....x....2x...0....CFZ
A094436 u 1....x....0....x....x+1..0....CFFN
A094437 v 1....x....0....x....x+1..0....CEFF
A117919 u 1....x....0....2x...1....0....BCNT
A135837 v 1....x....0....2x...1....0....BCET
A208328 u 1....x....0....2x...x....0....CCOP
A208329 v 1....x....0....2x...x....0....DPZ
A208330 u 1....x....0....2x...x+1..0....CNPT
A208331 v 1....x....0....2x...x+1..0....CN
A208332 u 1....x....0....2x...2x...0....CCE
A208333 v 1....x....0....2x...2x...0....DZ
A208334 u 1....x....0....x+1..1....0....CCNT
A208335 v 1....x....0....x+1..1....0....CCN*
A208336 u 1....x....0....x+1..x....0....CFNT*
A208337 v 1....x....0....x+1..x....0....ACFN*
A208338 u 1....x....0....x+1..2x...0....CNP
A208339 v 1....x....0....x+1..2x...0....BCNP
A202390 u 1....x....0....x+1..x+1..0....CFPTZ*
A208340 v 1....x....0....x+1..x+1..0....FNPZ*
A208508 u 1....x....0....1....1....1....CCES
A208509 v 1....x....0....1....1....1....BCO
A208510 u 1....x....0....1....x....1....CCCNOS*
A029653 v 1....x....0....1....x....1....BCDOSZ*
A208511 u 1....x....0....1....2x...1....BCFO
A208512 v 1....x....0....1....2x...1....BDFO
A208513 u 1....x....0....1....x+1..1....CCES*
A111125 v 1....x....0....1....x+1..1....COO*
A133567 u 1....x....0....x....1....1....CCOTT
A133084 v 1....x....0....x....1....1....BBCEN
A208514 u 1....x....0....x....x....1....CEFN
A208515 v 1....x....0....x....x....1....BCDFN
A208516 u 1....x....0....x....2x...1....CNN
A208517 v 1....x....0....x....2x...1....CCN
A208518 u 1....x....0....x....x+1..1....CFNT
A208519 v 1....x....0....x....x+1..1....NFFT
A208520 u 1....x....0....2x...1....1....BCTT
A208521 v 1....x....0....2x...1....1....BEN
A208522 u 1....x....0....2x...x....1....CCN
A208523 v 1....x....0....2x...x....1....CCO
A208524 u 1....x....0....2x...x+1..1....CT*
A208525 v 1....x....0....2x...x+1..1....ACNP*
A208526 u 1....x....0....2x...2x...1....CEN
A208527 v 1....x....0....2x...2x...1....CCE
A208606 u 1....x....0....x+1..1....1....CCS
A208607 v 1....x....0....x+1..1....1....CNO
A208608 u 1....x....0....x+1..x....1....CFOT
A208609 v 1....x....0....x+1..x....1....DEN*
A208610 u 1....x....0....x+1..2x...1....CO
A208611 v 1....x....0....x+1..2x...1....DE
A208612 u 1....x....0....x+1..x+1..1....CFNS
A208613 v 1....x....0....x+1..x+1..1....CFN*
A105070 u 1....2x...0....1....1....0....BN
A207536 u 1....2x...0....1....1....0....BCT
A208751 u 1....2x...0....1....x+1..0....CDPT
A208752 v 1....2x...0....1....x+1..0....CNP
A135837 u 1....2x...0....x....1....0....BCNT
A117919 v 1....2x...0....x....1....0....BCNT
A208755 u 1....2x...0....x....x....0....BCDEP
A208756 v 1....2x...0....x....x....0....BCCOZ
A208757 u 1....2x...0....x....2x...0....CDEP
A208758 v 1....2x...0....x....2x...0....CCEPZ
A208763 u 1....2x...0....2x...x....0....CDOP
A208764 v 1....2x...0....2x...x....0....CCCP
A208765 u 1....2x...0....2x...x+1..0....CE
A208766 v 1....2x...0....2x...x+1..0....CC
A208747 u 1....2x...0....2x...2x...0....CDE
A208748 v 1....2x...0....2x...2x...0....CCZ
A208749 u 1....2x...0....x+1..1....0....BCOPT
A208750 v 1....2x...0....x+1..1....0....BCNP*
A208759 u 1....2x...0....x+1..2x....0...CE
A208760 v 1....2x...0....x+1..2x....0...BCO
A208761 u 1....2x...0....x+1..x+1...0...BCCT*
A208762 v 1....2x...0....x+1..x+1...0...BNZ*
A208753 u 1....2x...0....1....1.....1...BCS
A208754 v 1....2x...0....1....1.....1...BO
A105045 u 1....2x...0....1....2x....1...BCCOS*
A208659 v 1....2x...0....1....2x....1...BDOSZ*
A208660 u 1....2x...0....1....x+1...1...CDS
A208904 v 1....2x...0....1....x+1...1...CNO
A208905 u 1....2x...0....x....1.....1...BCT
A208906 v 1....2x...0....x....1.....1...BNN
A208907 u 1....2x...0....x....x.....1...BCN
A208756 v 1....2x...0....x....x.....1...BCCE
A208755 u 1....2x...0....x....2x....1...CEN
A208910 v 1....2x...0....x....2x....1...CCE
A208911 u 1....2x...0....x....x+1...1...BCT
A208912 v 1....2x...0....x....x+1...1...BNT
A208913 u 1....2x...0....2x...1.....1...BCT
A208914 v 1....2x...0....2x...1.....1...BEN
A208915 u 1....2x...0....2x...x.....1...CE
A208916 v 1....2x...0....2x...x.....1...CCO
A208919 u 1....2x...0....2x...x+1...1...CT
A208920 v 1....2x...0....2x...x+1...1...N
A208917 u 1....2x...0....2x...2x....1...CEN
A208918 v 1....2x...0....2x...2x....1...CCNP
A208921 u 1....2x...0....x+1..1.....1...BC
A208922 v 1....2x...0....x+1..1.....1...BON
A208923 u 1....2x...0....x+1..x.....1...BCNO
A208908 v 1....2x...0....x+1..x.....1...BDN*
A208909 u 1....2x...0....x+1..2x....1...BN
A208930 v 1....2x...0....x+1..2x....1...DN
A208931 u 1....2x...0....x+1..x+1...1...BCOS
A208932 v 1....2x...0....x+1..x+1...1...BCO*
A207537 u 1....x+1..0....1....1.....0...BCO
A207538 v 1....x+1..0....1....1.....0...BCE
A122075 u 1....x+1..0....1....x.....0...CCFN*
A037027 v 1....x+1..0....1....x.....0...CCFN*
A209125 u 1....x+1..0....1....2x....0...BCFN*
A164975 v 1....x+1..0....1....2x....0...BF
A209126 u 1....x+1..0....x....x.....0...CDFO*
A209127 v 1....x+1..0....x....x.....0...DFOZ*
A209128 u 1....x+1..0....x....2x....0...CDE*
A209129 v 1....x+1..0....x....2x....0...DEZ
A102756 u 1....x+1..0....x....x+1...0...CFNP*
A209130 v 1....x+1..0....x....x+1...0...CCFNP*
A209131 u 1....x+1..0....2x...x.....0...CDEP*
A209132 v 1....x+1..0....2x...x.....0...CNPZ*
A209133 u 1....x+1..0....2x...2x....0...CDN
A209134 v 1....x+1..0....2x...2x....0...CCN*
A209135 u 1....x+1..0....2x...x+1...0...CN*
A209136 v 1....x+1..0....2x...x+1...0...CCS*
A209137 u 1....x+1..0....x+1..x.....0...CFFP*
A209138 v 1....x+1..0....x+1..x.....0...AFFP*
A209139 u 1....x+1..0....x+1..2x....0...CF*
A209140 v 1....x+1..0....x+1..2x....0...BF
A209141 u 1....x+1..0....x+1..x+1...0...BCF*
A209142 v 1....x+1..0....x+1..x+1...0...BFZ*
A209143 u 1....x+1..0....1....1.....1...CCE*
A209144 v 1....x+1..0....1....1.....1...COO*
A209145 u 1....x+1..0....1....x.....1...CCFN*
A122075 v 1....x+1..0....1....x.....1...CCFN*
A209146 u 1....x+1..0....1....2x....1...BCF*
A209147 v 1....x+1..0....1....2x....1...BF
A209148 u 1....x+1..0....1....x+1...1...CCO*
A209149 v 1....x+1..0....1....x+1...1...CDO*
A209150 u 1....x+1..0....x....1.....1...CCNT*
A208335 v 1....x+1..0....x....1.....1...CDNN*
A209151 u 1....x+1..0....x....x.....1...CFN*
A208337 v 1....x+1..0....x....x.....1...ACFN*
A209152 u 1....x+1..0....x....2x....1...CN*
A208339 v 1....x+1..0....x....x.....1...BCN
A209153 u 1....x+1..0....x....x+1...1...CFT*
A208340 v 1....x+1..0....x....x.....1...FNZ*
A209154 u 1....x+1..0....2x...1.....1...BCT*
A209157 v 1....x+1..0....2x...1.....1...BNN
A209158 u 1....x+1..0....2x...x.....1...CN*
A209159 v 1....x+1..0....2x...x.....1...CO*
A209160 u 1....x+1..0....2x...2x....1...CN*
A209161 v 1....x+1..0....2x...2x....1...CE
A209162 u 1....x+1..0....2x...x+1...1...CT*
A209163 v 1....x+1..0....2x...x+1...1...CO*
A209164 u 1....x+1..0....x+1..1.....1...CC*
A209165 v 1....x+1..0....x+1..1.....1...CCN
A209166 u 1....x+1..0....x+1..x.....1...CFF*
A209167 v 1....x+1..0....x+1..x.....1...FF*
A209168 u 1....x+1..0....x+1..2x....1...CF*
A209169 v 1....x+1..0....x+1..2x....1...CF
A209170 u 1....x+1..0....x+1..x+1...1...CF*
A209171 v 1....x+1..0....x+1..x+1...1...CF*
A053538 u x....1....0....1....1.....0...BBCCFN
A076791 v x....1....0....1....1.....0...BBCDF
A209172 u x....1....0....1....2x....0...BCCFF
A209413 v x....1....0....1....2x....0...BCCFF
A094441 u x....1....0....1....x+1...0...CFFFN
A094442 v x....1....0....1....x+1...0...CEFFF
A054142 u x....1....0....x....x+1...0...CCFOT*
A172431 v x....1....0....x....x+1...0...CEFN*
A008288 u x....1....0....2x...1.....0...CCOO*
A035607 v x....1....0....2x...1.....0...ACDE*
A209414 u x....1....0....2x...x+1...0...CCS
A112351 v x....1....0....2x...x+1...0...CON
A209415 u x....1....0....x+1..x.....0...CCTN
A209416 v x....1....0....x+1..x.....0...ACN*
A209417 u x....1....0....x+1..2x....0...CC
A209418 v x....1....0....x+1..2x....0...BBC
A209419 u x....1....0....x+1..x+1...0...CFTZ*
A209420 v x....1....0....x+1..x+1...0...FNZ*
A209421 u x....1....0....1....1.....1...CCN
A209422 v x....1....0....1....1.....1...CD
A209555 u x....1....0....1....x.....1...CNN
A209556 v x....1....0....1....x.....1...CNN
A209557 u x....1....0....1....2x....1...BCN
A209558 v x....1....0....1....2x....1...BN
A209559 u x....1....0....1....x+1...1...CN
A209560 v x....1....0....1....x+1...1...CN
A209561 u x....1....0....x....1.....1...CCNNT*
A209562 v x....1....0....x....1.....1...CDNNT*
A209563 u x....1....0....x....x.....1...CCFT^
A209564 v x....1....0....x....x.....1...CFN^
A209565 u x....1....0....x....2x....1...CC^
A209566 v x....1....0....x....2x....1...BC^
A209567 u x....1....0....x....x+1...1...CNT*
A209568 v x....1....0....x....x+1...1...NNS*
A209569 u x....1....0....2x...1.....1...CNO*
A209570 v x....1....0....2x...1.....1...DNN*
A209571 u x....1....0....2x...x.....1...CCS^
A209572 v x....1....0....2x...x.....1...CN^
A209573 u x....1....0....2x...x+1...1...CNS
A209574 v x....1....0....2x...x+1...1...NO
A209575 u x....1....0....2x...2x....1...CC
A209576 v x....1....0....2x...2x....1...C
A209577 u x....1....0....x+1..1.....1...CNNT
A209578 v x....1....0....x+1..1.....1...CNN
A209579 u x....1....0....x+1..x.....1...CNNT
A209580 v x....1....0....x+1..x.....1...NN*
A209581 u x....1....0....x+1..2x....1...CN
A209582 v x....1....0....x+1..2x....1...BN
A209583 u x....1....0....x+1..x+1...1...CT*
A209584 v x....1....0....x+1..x+1...1...CN*
A121462 u x....x....0....x....x+1...0...BCFFNZ
A208341 v x....x....0....x....x+1...0...BCFFN
A209687 u x....x....0....2x...x+1...0...BCNZ
A208339 v x....x....0....2x...x+1...0...BCN
A115241 u x....x....0....1....1.....1...CDNZ*
A209688 v x....x....0....1....1.....1...DDN*
A209689 u x....x....0....1....x.....1...FNZ^
A209690 v x....x....0....1....x.....1...FN^
A209691 u x....x....0....1....2x....1...BCZ^
A209692 v x....x....0....1....2x....1...BCC^
A209693 u x....x....0....1....x+1...1...NNZ*
A209694 v x....x....0....1....x+1...1...CN*
A209697 u x....x....0....x....x+1...1...BNZ
A209698 v x....x....0....x....x+1...1...BNT
A209699 u x....x....0....2x...1.....1...BNNZ
A209700 v x....x....0....2x...1.....1...BDN
A209701 u x....x....0....2x...x+1...1...NZ
A209702 v x....x....0....2x...x+1...1...N
A209703 u x....x....0....x+1..1.....1...FNTZ
A209704 v x....x....0....x+1..1.....1...FNNT
A209705 u x....x....0....x+1..x+1...1...BNZ*
A209706 v x....x....0....x+1..x+1...1...BCN*
A209695 u x....x+1..0....2x...x+1...0...ACN*
A209696 v x....x+1..0....2x...x+1...0...CDN*
A209830 u x....x+1..0....x+1..2x....0...ACF
A209831 v x....x+1..0....x+1..2x....0...BCF*
A209745 u x....x+1..0....x+1..x+1...0...ABF*
A209746 v x....x+1..0....x+1..x+1...0...BFZ*
A209747 u x....x+1..0....1....1.....1...ADE*
A209748 v x....x+1..0....1....1.....1...DEO
A209749 u x....x+1..0....1....x.....1...ANN*
A209750 v x....x+1..0....1....x.....1...CNO
A209751 u x....x+1..0....1....2x....1...ABN*
A209752 v x....x+1..0....1....2x....1...BN
A209753 u x....x+1..0....1....x+1...1...AN*
A209754 v x....x+1..0....1....x+1...1...NT*
A209755 u x....x+1..0....x....1.....1...AFN
A209756 v x....x+1..0....x....1.....1...FNO*
A209759 u x....x+1..0....x....2x....1...ACF^
A209760 v x....x+1..0....x....2x....1...CF^*
A209761 u x....x+1..0....x.....x+1..1...ABNS*
A209762 v x....x+1..0....x.....x+1..1...BNS*
A209763 u x....x+1..0....2x....1....1...ABN*
A209764 v x....x+1..0....2x....1....1...BNN
A209765 u x....x+1..0....2x....x....1...ACF^*
A209766 v x....x+1..0....2x....x....1...CF^
A209767 u x....x+1..0....2x....x+1..1...AN*
A209768 v x....x+1..0....2x....x+1..1...N*
A209769 u x....x+1..0....x+1...1....1...AF*
A209770 v x....x+1..0....x+1...1....1...FN
A209771 u x....x+1..0....x+1...x....1...ABN*
A209772 v x....x+1..0....x+1...x....1...BN*
A209773 u x....x+1..0....x+1...2x...1...AF
A209774 v x....x+1..0....x+1...2x...1...FN*
A209775 u x....x+1..0....x+1...x+1..1...AB*
A209776 v x....x+1..0....x+1...x+1..1...BC*
A210033 u 1....1....1....1.....x....1...BCN
A210034 v 1....1....1....1.....x....1...BCDFN
A210035 u 1....1....1....1.....2x...1...BBF
A210036 v 1....1....1....1.....2x...1...BBFF
A210037 u 1....1....1....1.....x+1..1...BCFFN
A210038 v 1....1....1....1.....x+1..1...BCFFN
A210039 u 1....1....1....x.....1....1...BCOT
A210040 v 1....1....1....x.....1....1...BCEN
A210042 u 1....1....1....x.....x....1...BCDEOT*
A124927 v 1....1....1....x.....x....1...BCDET*
A210041 u 1....1....1....x.....2x...1...BFO
A209758 v 1....1....1....x.....2x...1...BCFO
A210187 u 1....1....1....x.....x+1..1...DTF*
A210188 v 1....1....1....x.....x+1..1...DNF*
A210189 u 1....1....1....2x....1....1...BT
A210190 v 1....1....1....2x....1....1...BN
A210191 u 1....1....1....2x....x....1...CO*
A210192 v 1....1....1....2x....x....1...CCO*
A210193 u 1....1....1....2x....x+1..1...CPT
A210194 v 1....1....1....2x....x+1..1...CN
A210195 u 1....1....1....2x....2x...1...BOPT*
A210196 v 1....1....1....2x....2x...1...BCC*
A210197 u 1....1....1....x+1...1....1...BCOT
A210198 v 1....1....1....x+1...1....1...BCEN
A210199 u 1....1....1....x+1...x....1...DFT
A210200 v 1....1....1....x+1...x....1...DFO*
A210201 u 1....1....1....x+1...2x...1...BFP
A210202 v 1....1....1....x+1...2x...1...BF
A210203 u 1....1....1....x+1...x+1..1...BDOP
A210204 v 1....1....1....x+1...x+1..1...BCDN*
A210211 u x....1....1....1.....2x...1...BCFN
A210212 v x....1....1....1.....2x...1...BFN
A210213 u x....1....1....1.....x+1..1...CFFN
A210214 v x....1....1....1.....x+1..1...CFFO
A210215 u x....1....1....x.....x....1...BCDFT^
A210216 v x....1....1....x.....x....1...BCFO^
A210217 u x....1....1....x.....2x...1...CDF^
A210218 v x....1....1....x.....2x...1...BCF^
A210219 u x....1....1....x.....x+1..1...CNSTF*
A210220 v x....1....1....x.....x+1..1...FNNT*
A104698 u x....1....1....2x......1..1...CENS*
A210220 v x....1....1....2x....x+1..1...DNNT*
A210223 u x....1....1....2x....x....1...CD^
A210224 v x....1....1....2x....x....1...CO^
A210225 u x....1....1....2x....x+1..1...CNP
A210226 v x....1....1....2x....x+1..1...NOT
A210227 u x....1....1....2x....2x...1...CDP^
A210228 v x....1....1....2x....2x...1...C^
A210229 u x....1....1....x+1...1....1...CFNN
A210230 v x....1....1....x+1...1....1...CCN
A210231 u x....1....1....x+1...x....1...CNT
A210232 v x....1....1....x+1...x....1...NN*
A210233 u x....1....1....x+1...2x...1...CNP
A210234 v x....1....1....x+1...2x...1...BN
A210235 u x....1....1....x+1...x+1..1...CCFPT*
A210236 v x....1....1....x+1...x+1..1...CFN*
A124927 u x....x....1....1.....1....1...BCDEET*
A210042 v x....1....1....x+1...x+1..1...BDEOT*
A210216 u x....x....1....1.....x....1...BCFO^
A210215 v x....x....1....1.....x....1...BCDFT^
A210549 u x....x....1....1.....2x...1...BCF^
A210550 v x....x....1....1.....2x...1...BDF^
A172431 u x....x....1....1.....x+1..1...CEFN*
A210551 v x....x....1....1.....x+1..1...CFOT*
A210552 u x....x....1....x.....1....1...BBCFNO
A210553 v x....x....1....x.....1....1...BNNFB
A208341 u x....x....1....x.....x+1..1...BCFFN
A210554 v x....x....1....x.....x+1..1...BNFFT
A210555 u x....x....1....2x....1....1...BCNN
A210556 v x....x....1....2x....1....1...BENP
A210557 u x....x....1....2x....x+1..1...CNP
A210558 v x....x....1....2x....x+1..1...N
A210559 u x....x....1....x+1...1....1...CEF
A210560 v x....x....1....x+1...1....1...OFNS
A210561 u x....x....1....x+1...x....1...BCNP^
A210562 v x....x....1....x+1...x....1...BDP*^
A210563 u x....x....1....x+1...2x...1...CFP^
A210564 v x....x....1....x+1...2x...1...DF^
A013609 u x....x....1....x+1...x+1..1...BCEPT*
A209757 v x....x....1....x+1...x+1..1...BCOS*
A209819 u x....2x...1....x+1...x....1...CFN^
A209820 v x....2x...1....x+1...x....1...DF^
A209996 u x....2x...1....x+1...2x...1...CP^
A209998 v x....2x...1....x+1...2x...1...DP^
A209999 u x....x+1..1....1.....x+1..1...FN*
A210287 v x....x+1..1....1.....x+1..1...CFT*
A210565 u x....x+1..1....x.....1....1...FNT*
A210595 v x....x+1..1....x.....1....1...FNNT
A210598 u x....x+1..1....x+1...2x...1...FN*
A210599 v x....x+1..1....x+1...2x...1...FN
A210600 u x....x+1..1....x+1...x+1..1...BF*
A210601 v x....x+1..1....x+1...x+1..1...BF*
A210597 u 2x...1....1....x+1...1....1...BF
A210601 v 2x...1....1....x+1...1....1...BFN*
A210603 u 2x...1....1....x+1...x+1..1...BF
A210738 v 2x...1....1....x+1...x+1..1...CBF*
A210739 u 2x...x....1....x+1...x....1...CF^
A210740 v 2x...x....1....x+1...x....1...DF*^
A210741 u 2x...x....1....x+1...x+1..1...BCFO
A210742 v 2x...x....1....x+1...x+1..1...CFO*
A210743 u 2x...x+1..1....x+1...1....1...F
A210744 v 2x...x+1..1....x+1...1....1...FN
A210747 u 2x...x+1..1....x+1...x+1..1...FF
A210748 v 2x...x+1..1....x+1...x+1..1...CFF*
A210749 u x+1..1....1....x+1...2x...1...BCF
A210750 v x+1..1....1....x+1...2x...1...BF
A210751 u x+1..x....1....x+1...2x...1...FNT
A210752 v x+1..x....1....x+1...2x...1...FN
A210753 u x+1..x....1....x+1...x+1..1...BNZ*
A210754 v x+1..x....1....x+1...x+1..1...BCT*
A210755 u x+1..2x...1....x+1...x+1..1...N*
A210756 v x+1..2x...1....x+1...x+1..1...CT*
A210789 u 1....x....0....x+2...x-1..0...CFFN
A210790 v 1....x....0....x+2...x-1..0...CEFF
A210791 u 1....x....0....x-1...x+2..0...CFNP
A210792 v 1....x....0....x-1...x+2..0...CF
A210793 u 1....x+1..0....x+2...x-1..0...CFNP
A210794 v 1....x+1..0....x+2...x-1..0...FPP
A210795 u 1....x....1....x+2...x-1..0...FN
A210796 v 1....x....1....x+2...x-1..0...FO
A210797 u 1....x....0....x+2...x-1..1...CF
A210798 v 1....x....0....x+2...x-1..1...F
A210799 u 1....x+1..1....x+2...x-1..0...FN
A210800 v 1....x+1..1....x+2...x-1..0...F
A210801 u 1....x+1..1....x+2...x-1..1...FN
A210802 v 1....x+1..1....x+2...x-1..1...F
A210803 u 1....x....0....x-1...x+3..0...F*
A210804 v 1....x....0....x-1...x+3..0...F*
A210805 u 1....x....0....x+2...x-1.-1...CFFN
A210806 v 1....x....0....x+2...x-1.-1...FF
A210858 u 1....x....0....x+n...x....0...CFT*
A210859 v 1....x....0....x+n...x....0...FN*
A210860 u 1....x+1..0....x+n...x....0...F
A210861 v 1....x+1..0....x+n...x....0...F*
A210862 u 1....x....1....x+n-1.x....0...FN
A210863 v 1....x....1....x+n-1.x....0...FS
A210864 u 1....x....1....x+n...x....0...FN
A210865 v 1....x....1....x+n...x....0...FT
A210866 u 1....x....0....x+n...x...-x...CFT
A210867 v 1....x....0....x+n...x...-x...FN
A210868 u 1....x....0....x+1...x-1..0...BCFN
A210869 v 1....x....0....x+1...x-1..0...BBCFNZ
A210870 u 1....x....0....x+1...x-1..1...CFFN
A210871 v 1....x....0....x+1...x-1..1...CFF
A210872 u x....1...-1....x.....x....1...BDFZ^
A210873 v x....1...-1....x.....x....1...BCFN^
A210876 u x....1....1....x.....x....x...BCCF^
A210877 v x....1....1....x.....x....x...BDFNZ^
A210878 u x....2x...0....x+1...x....1...DFZ^
A210879 v x....2x...0....x+1...x....1...FC*^
Some of these triangles have irregular row lengths, making it difficult to retrieve individual rows/columns/diagonals without actually computing the recurrence. - Georg Fischer, Sep 04 2021

Examples

			First five rows:
1
1...1
1...3...1
1...5...4...1
1...7...9...5...1
First five polynomials u(n,x):
1
1 + x
1 + 3x + x^2
1 + 5x + 4x^2 + x^3
1 + 7x + 9x^2 + 5x^3 + x^4
		

Crossrefs

Programs

  • Mathematica
    u[1, x_] := 1; v[1, x_] := 1; z = 16;
    u[n_, x_] := u[n - 1, x] + x*v[n - 1, x];
    v[n_, x_] := u[n - 1, x] + x*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[%]   (* A208510 *)
    Table[Expand[v[n, x]], {n, 1, z}]
    cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
    TableForm[cv]
    Flatten[%]   (* A029653 *)
  • Python
    from sympy import Poly
    from sympy.abc import x
    def u(n, x): return 1 if n==1 else u(n - 1, x) + x*v(n - 1, x)
    def v(n, x): return 1 if n==1 else u(n - 1, x) + x*v(n - 1, x) + 1
    def a(n): return Poly(u(n, x), x).all_coeffs()[::-1]
    for n in range(1, 13): print(a(n)) # Indranil Ghosh, May 27 2017

Formula

u(n,x)=u(n-1,x)+x*v(n-1,x),
v(n,x)=u(n-1,x)+x*v(n-1,x)+1,
where u(1,x)=1, v(1,x)=1.
Also, u(n,x)=(x+1)*u(n-1,x)+x for n>2, with u(n,2)=x+1.

Extensions

Corrected by Philippe Deléham, Apr 10 2012
Corrections and additions by Clark Kimberling, May 09 2012
Corrections in the overview by Georg Fischer, Sep 04 2021

A384893 Triangle read by rows where T(n,k) is the number of subsets of {1..n} with k maximal anti-runs (increasing by more than 1).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 7, 5, 2, 1, 1, 12, 10, 6, 2, 1, 1, 20, 20, 13, 7, 2, 1, 1, 33, 38, 29, 16, 8, 2, 1, 1, 54, 71, 60, 39, 19, 9, 2, 1, 1, 88, 130, 122, 86, 50, 22, 10, 2, 1, 1, 143, 235, 241, 187, 116, 62, 25, 11, 2, 1, 1, 232, 420, 468, 392, 267, 150, 75, 28, 12, 2, 1
Offset: 0

Views

Author

Gus Wiseman, Jun 21 2025

Keywords

Examples

			The subset {3,6,7,9,11,12} has maximal anti-runs ((3,6),(7,9,11),(12)), so is counted under T(12,3).
The subset {3,6,7,9,10,12} has maximal anti-runs ((3,6),(7,9),(10,12)), so is counted under T(12,3).
Row n = 5 counts the following subsets:
  {}  {1}      {1,2}    {1,2,3}    {1,2,3,4}  {1,2,3,4,5}
      {2}      {2,3}    {2,3,4}    {2,3,4,5}
      {3}      {3,4}    {3,4,5}
      {4}      {4,5}    {1,2,3,5}
      {5}      {1,2,4}  {1,2,4,5}
      {1,3}    {1,2,5}  {1,3,4,5}
      {1,4}    {1,3,4}
      {1,5}    {1,4,5}
      {2,4}    {2,3,5}
      {2,5}    {2,4,5}
      {3,5}
      {1,3,5}
Triangle begins:
   1
   1   1
   1   2   1
   1   4   2   1
   1   7   5   2   1
   1  12  10   6   2   1
   1  20  20  13   7   2   1
   1  33  38  29  16   8   2   1
   1  54  71  60  39  19   9   2   1
   1  88 130 122  86  50  22  10   2   1
   1 143 235 241 187 116  62  25  11   2   1
   1 232 420 468 392 267 150  75  28  12   2   1
   1 376 744 894 806 588 363 188  89  31  13   2   1
		

Crossrefs

Column k = 1 is A000071.
Row sums are A000079.
Column k = 2 is A001629.
For runs instead of anti-runs we have A034839, for strict partitions A116674.
The case containing n is A053538.
For integer partitions instead of subsets we have A268193, strict A384905.
A384175 counts subsets with all distinct lengths of maximal runs, complement A384176.
A384877 gives lengths of maximal anti-runs in binary indices, firsts A384878.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n]],Length[Split[#,#2!=#1+1&]]==k&]],{n,0,10},{k,0,n}]

A384905 Triangle read by rows where T(n,k) is the number of strict integer partitions of n with k maximal anti-runs (decreasing by more than 1).

Original entry on oeis.org

1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 0, 3, 2, 0, 0, 0, 0, 0, 0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 5, 2, 1, 0, 0, 0, 0, 0, 0, 0, 6, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 7, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Gus Wiseman, Jun 21 2025

Keywords

Examples

			The T(10,2) = 3 strict partitions with 2 maximal anti-runs are: (7,2,1), (5,4,1), (5,3,2).
Triangle begins:
  1
  0  1
  0  1  0
  0  1  1  0
  0  2  0  0  0
  0  2  1  0  0  0
  0  3  0  1  0  0  0
  0  3  2  0  0  0  0  0
  0  4  2  0  0  0  0  0  0
  0  5  2  1  0  0  0  0  0  0
  0  6  3  0  1  0  0  0  0  0  0
  0  7  4  1  0  0  0  0  0  0  0  0
  0  9  3  3  0  0  0  0  0  0  0  0  0
		

Crossrefs

Row sums are A000009.
Column k = 1 is A003114.
For subsets instead of strict integer partitions see A053538, A119900, A210034.
For runs instead of anti-runs we have A116674, for subsets A034839.
This is the strict case of A268193.
A384175 counts subsets with all distinct lengths of maximal runs, complement A384176.
A384877 gives lengths of maximal anti-runs in binary indices, firsts A384878.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Length[Split[#,#1!=#2+1&]]==k&]],{n,0,10},{k,0,n}]

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

Original entry on oeis.org

1, 2, 1, 4, 2, 1, 7, 5, 2, 1, 12, 10, 6, 2, 1, 20, 20, 13, 7, 2, 1, 33, 38, 29, 16, 8, 2, 1, 54, 71, 60, 39, 19, 9, 2, 1, 88, 130, 122, 86, 50, 22, 10, 2, 1, 143, 235, 241, 187, 116, 62, 25, 11, 2, 1, 232, 420, 468, 392, 267, 150, 75, 28, 12, 2, 1, 376, 744, 894, 806
Offset: 1

Views

Author

Clark Kimberling, Mar 16 2012

Keywords

Comments

For a discussion and guide to related arrays, see A208510.
From Gus Wiseman, Jun 29 2025: (Start)
This appears to be the number of subsets of {1..n} with k>0 maximal anti-runs (sequences of consecutive elements increasing by more than 1). For example, the subset {1,2,4,5} has maximal anti-runs ((1),(2,4),(5)) so is counted under T(5,3). Row n = 5 counts the following:
{1} {1,2} {1,2,3} {1,2,3,4} {1,2,3,4,5}
{2} {2,3} {2,3,4} {2,3,4,5}
{3} {3,4} {3,4,5}
{4} {4,5} {1,2,3,5}
{5} {1,2,4} {1,2,4,5}
{1,3} {1,2,5} {1,3,4,5}
{1,4} {1,3,4}
{1,5} {1,4,5}
{2,4} {2,3,5}
{2,5} {2,4,5}
{3,5}
{1,3,5}
For runs instead of anti-runs we have A034839, with n A202064. For reversed partitions instead of subsets we have A268193. (End)

Examples

			First five rows:
  1
  2    1
  4    2    1
  7    5    2   1
  12   10   6   2   1
First three polynomials v(n,x): 1, 2 + x, 4 + 2*x + x^2.
		

Crossrefs

Column k = 1 is A000071.
Row sums are A000225.
Column k = 2 is A001629.
Column k = 3 is A055243.
The version including k = 0 is A384893.
A034839 counts subsets by number of maximal runs, see also A202023, A202064.
A384175 counts subsets with all distinct lengths of maximal runs, complement A384176.
A384877 gives lengths of maximal anti-runs of binary indices, firsts A384878.

Programs

  • Mathematica
    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_] := u[n - 1, x] + x*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[%]    (* A210033 *)
    Table[Expand[v[n, x]], {n, 1, z}]
    cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
    TableForm[cv]
    Flatten[%]    (* A210034 *)

Formula

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

A208342 Triangle of coefficients of polynomials u(n,x) jointly generated with A208343; see the Formula section.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 5, 5, 1, 1, 5, 7, 10, 8, 1, 1, 6, 9, 16, 18, 13, 1, 1, 7, 11, 23, 31, 33, 21, 1, 1, 8, 13, 31, 47, 62, 59, 34, 1, 1, 9, 15, 40, 66, 101, 119, 105, 55, 1, 1, 10, 17, 50, 88, 151, 205, 227, 185, 89, 1, 1, 11, 19, 61, 113, 213, 321, 414
Offset: 1

Views

Author

Clark Kimberling, Feb 25 2012

Keywords

Comments

Coefficient of x^(n-1): A000045(n) (Fibonacci numbers).
n-th row sum: 2^(n-1).
Mirror image of triangle in A053538. - Philippe Deléham, Mar 05 2012
Subtriangle of the triangle T(n,k) given by (1, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Mar 12 2012

Examples

			First five rows:
  1
  1, 1
  1, 1, 2
  1, 1, 3, 3
  1, 1, 4, 5, 5
First five polynomials u(n,x): 1, 1 + x, 1 + x + x^2, 1 + x + 3*x^2 + 3*x^3, 1 + x + 4*x^2 + 5*x^3 + 5*x^4.
(1, 0, -1, 1, 0, 0, ...) DELTA (0, 1, 1, -1, 0, 0, ...) begins:
1
1, 0
1, 1, 0
1, 1, 2,  0
1, 1, 3,  3,  0
1, 1, 4,  5,  5,  0
1, 1, 5,  7, 10,  8,  0
1, 1, 6,  9, 16, 18, 13,  0
1, 1, 7, 11, 23, 31, 33, 21, 0
		

Crossrefs

Programs

  • Mathematica
    u[1, x_] := 1; v[1, x_] := 1; z = 13;
    u[n_, x_] := u[n - 1, x] + x*v[n - 1, x];
    v[n_, x_] := x*u[n - 1, x] + x*v[n - 1, x];
    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[%]  (* A208342 *)
    Table[Expand[v[n, x]], {n, 1, z}]
    cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
    TableForm[cv]
    Flatten[%]  (* A208343 *)

Formula

u(n,x) = u(n-1,x) + x*v(n-1,x),
v(n,x) = x*u(n-1,x) + x*v(n-1,x),
where u(1,x) = 1, v(1,x) = 1.
T(n,k) = A208747(n,k)/2^k. - Philippe Deléham, Mar 05 2012
From Philippe Deléham, Mar 12 2012: (Start)
As DELTA-triangle T(n,k) with 0<=k<=n:
G.f.: (1-y*x+y*x^2-y^2*x^2)/(1-x-y*x+t*x^2-y^2*x^2).
T(n,k) = T(n-1,k) + T(n-1,k-1) - T(n-2,k-1) + T(n-2,k-2), T(0,0) = T(1,0) = T(2,0) = T(2,1) = 1, T(1,1) = T(2,2) = 0 and T(n,k) = 0 if k<0 or if k>n. (End)
O.g.f.: 1/(1 - z - x*z(1 - z + x*z)) = 1 + (1 + x)*z + (1 + x + 2*x^2)*z^2 + (1 + x + 3*x + 3*x^2)*z^3 + .... - Peter Bala, Dec 31 2015
u(n,x) = Sum_{j=1..floor((n+1)/2)} (-1)^(j-1)*binomial(n-j,j-1)*(x*(1-x))^(j-1)* (1+x)^(n+1-2*j) for n>=1. - Werner Schulte, Mar 07 2017
T(n,k) = Sum_{j=0..floor((k-1)/2)} binomial(k-1-j,j)*binomial(n-k+j,j) for k,n>0 and k<=n (conjectured). - Werner Schulte, Mar 07 2017

A076791 Triangle a(n,k) giving number of binary sequences of length n containing k subsequences 00.

Original entry on oeis.org

1, 2, 3, 1, 5, 2, 1, 8, 5, 2, 1, 13, 10, 6, 2, 1, 21, 20, 13, 7, 2, 1, 34, 38, 29, 16, 8, 2, 1, 55, 71, 60, 39, 19, 9, 2, 1, 89, 130, 122, 86, 50, 22, 10, 2, 1, 144, 235, 241, 187, 116, 62, 25, 11, 2, 1, 233, 420, 468, 392, 267, 150, 75, 28, 12, 2, 1, 377, 744, 894, 806, 588, 363, 188, 89, 31, 13, 2, 1
Offset: 0

Views

Author

Roger Cuculière, Nov 16 2002

Keywords

Comments

The triangle of numbers of n-sequences of 0,1 with k subsequences of consecutive 01 is A034867 because this number is C(n+1,2*k+1). I have not yet found a formula for subsequences 00.
The problem is equivalent to one encountered by David W. Wilson, Dept of Geography, University of Southampton, UK, in his work on Markov models for rainfall disaggregation. He asked for the number of ways in which there can be k instances of adjacent rainy days in a period of n consecutive days. Representing a rainy day by 0 and a fine day by 1, the problem is equivalent to that solved by this sequence. - E. Keith Lloyd (ekl(AT)soton.ac.uk), Nov 29 2004
Row n (n>=1) contains n terms.
Triangle, with zeros omitted, given by (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Dec 12 2011
a(n-1,k) is also the number of permutations avoiding both 132 and 213 with k double descents, i.e., positions with w[i]>w[i+1]>w[i+2]. - Lara Pudwell, Dec 19 2018

Examples

			a(5,2) = 6 because the binary sequences of length 5 with 2 subsequences 00 are 10001, 11000, 01000, 00100, 00010, 00011.
Triangle begins
   1;
   2;
   3,  1;
   5,  2, 1;
   8,  5, 2, 1;
  13, 10, 6, 2, 1;
  ...
		

Crossrefs

Cf. a(n,1) = A001629, a(n,2) = A055243.

Programs

  • Maple
    b:= proc(n, l) option remember; `if`(n=0, 1,
          expand(b(n-1, 1)*x^l)+b(n-1, 0))
        end:
    T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n, 0)):
    seq(T(n), n=0..14);  # Alois P. Heinz, Sep 17 2019
  • Mathematica
    f[list_] := Select[list, #>0&]; nn=10; a=1/(1-y x); b= x/(1-y x) +1; c=1/(1-x); Map[f, CoefficientList[Series[c b/(1-(a x^2 c)), {x,0,nn}], {x,y}]]//Flatten (* Geoffrey Critzer, Mar 05 2012 *)
    u[1, x_] := 1; v[1, x_] := 1; z = 16;
    u[n_, x_] := x*u[n - 1, x] + v[n - 1, x];
    v[n_, x_] := u[n - 1, x] + v[n - 1, x];
    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[%]    (* A053538 *)
    Table[Expand[v[n, x]], {n, 1, z}]
    cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
    TableForm[cv]
    Flatten[%]    (* A076791 *)
    (* Clark Kimberling, Mar 08 2012 *)
    T[ n_, k_] := If[n<2, (n+1)*Boole[n > -1 && k == 0], T[n, k] = T[n-1, k] + T[n-1, k-1] + T[n-2, k] - T[n-2, k-1] ]; (* Michael Somos, Sep 21 2024 *)
  • PARI
    {T(n, k) = if(n<2, (n+1)*(n > -1 && k == 0), T(n-1, k) + T(n-1, k-1) + T(n-2, k) - T(n-2, k-1) )}; /* Michael Somos, Sep 21 2024 */

Formula

Recurrence: a(n, k) = (a(n-1, k) + a(n-2, k)) + (a(n-3, k-1) + a(n-4, k-2) + ... + a(n-k-2, 0)).
Special values: a(n, 0) = Fibonacci(n+1); a(n, n-1) = 1 for n >= 2; a(n, n-2) = 2 for n >= 3; a(n, n-3) = n + 1 for n >= 4, etc.
a(n, n-4) = 3*n - 5 for n >= 5, a(n, n-5) = (n^2 + 5*n - 26)/2 for n >= 6, a(n, n-6) = 2*n^2 - 8*n - 4, for n >= 7 etc.
Recurrence relation: a(n+1, k) = a(n, k) + a(n-1, k) + a(n, k-1) - a(n-1, k-1) for k >= 1, n >= 1.
Generating function: a(n, k) is coefficient of x^n in ((x^(k + 1))*((1 - x)^(k - 1)))/((1 - x - x^2)^(k + 1)) for k >= 1. - E. Keith Lloyd (ekl(AT)soton.ac.uk), Nov 29 2004
G.f.: (1 + (1 - t)*x)/(1 - (1 + t)*x - (1 - t)*x^2). [Carlitz-Scoville] - Emeric Deutsch, May 19 2006
A076791 is jointly generated with A053538 as an array of coefficients of polynomials u(n,x): initially, u(1,x) = v(1,x) = 1; for n > 1, u(n,x) = x*u(n-1,x) + v(n-1)*x and v(n,x) = u(n-1,x) + v(n-1,x). See the Mathematica section. - Clark Kimberling, Mar 08 2012

Extensions

More terms from E. Keith Lloyd (ekl(AT)soton.ac.uk), Nov 29 2004

A202064 Triangle T(n,k), read by rows, given by (2, -1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 2, 0, 3, 1, 0, 4, 4, 0, 0, 5, 10, 1, 0, 0, 6, 20, 6, 0, 0, 0, 7, 35, 21, 1, 0, 0, 0, 8, 56, 56, 8, 0, 0, 0, 0, 9, 84, 126, 36, 1, 0, 0, 0, 0, 10, 120, 252, 120, 10, 0, 0, 0, 0, 0, 11, 165, 462, 330, 55, 1, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Dec 10 2011

Keywords

Comments

Riordan array (x/(1-x)^2, x^2/(1-x)^2).
Mirror image of triangle in A119900.
A203322*A130595 as infinite lower triangular matrices. - Philippe Deléham, Jan 05 2011
From Gus Wiseman, Jul 07 2025: (Start)
Also the number of subsets of {1..n} containing n with k maximal runs (sequences of consecutive elements increasing by 1). For example, row n = 5 counts the following subsets:
{5} {1,5} {1,3,5}
{4,5} {2,5}
{3,4,5} {3,5}
{2,3,4,5} {1,2,5}
{1,2,3,4,5} {1,4,5}
{2,3,5}
{2,4,5}
{1,2,3,5}
{1,2,4,5}
{1,3,4,5}
For anti-runs instead of runs we have A053538.
Without requiring n see A210039, A202023, reverse A098158, A109446.
(End)

Examples

			Triangle begins :
1
2, 0
3, 1, 0
4, 4, 0, 0
5, 10, 1, 0, 0
6, 20, 6, 0, 0, 0
7, 35, 21, 1, 0, 0, 0
8, 56, 56, 8, 0, 0, 0, 0
		

Crossrefs

Cf. A007318, A005314 (antidiagonal sums), A119900, A084938, A130595, A203322.
Column k = 1 is A000027.
Row sums are A000079.
Column k = 2 is A000292.
Without zeros we have A034867.
Last nonzero term in each row appears to be A124625.
A034839 counts subsets by number of maximal runs, for anti-runs A384893.
A116674 counts strict partitions by number of maximal runs, for anti-runs A384905.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&Length[Split[#,#2==#1+1&]]==k&]],{n,12},{k,n}] (* Gus Wiseman, Jul 07 2025 *)

Formula

G.f.: 1/((1-x)^2-y*x^2).
Sum_{k, 0<=k<=n} T(n,k)*x^k = A000027(n+1), A000079(n), A000129(n+1), A002605(n+1), A015518(n+1), A063727(n), A002532(n+1), A083099(n+1), A015519(n+1), A003683(n+1), A002534(n+1), A083102(n), A015520(n+1), A091914(n) for x = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 10, 11, 12, 13 respectively.
T(n,k) = binomial(n+1,2k+1).
T(n,k) = 2*T(n-1,k) + T(n-2,k-1) - T(n-2,k), T(0,0) = 1, T(1,0) = 2, T(1,1) = 0 and T(n,k) = 0 if k<0 or if k>n. - Philippe Deléham, Mar 15 2012

A108623 G.f. satisfies x = A(x)*(1-A(x))/(1-A(x)-(A(x))^2).

Original entry on oeis.org

1, 0, -1, -1, 1, 4, 3, -8, -23, -10, 67, 153, 9, -586, -1081, 439, 5249, 7734, -7941, -47501, -53791, 105314, 430119, 343044, -1249799, -3866556, -1730017, 13996097, 34243897, 1947204, -150962373, -296101864, 121857185, 1582561870
Offset: 1

Views

Author

Christian G. Bower, Jun 12 2005

Keywords

Comments

Row sums of inverse of Riordan array (1/(1-x-x^2), x*(1-x)/(1-x-x^2)) (Cf. A053538). - Paul Barry, Nov 01 2006

Examples

			G.f. = x - x^3 - x^4 + x^5 + 4*x^6 + 3*x^7 - 8*x^8 - 23*x^9 - 10*x^10 + ...
		

Crossrefs

Except for signs, same as A108624.

Programs

  • Magma
    R:=PowerSeriesRing(Rationals(), 41);
    Coefficients(R!( (1+x-Sqrt(1-2*x+5*x^2))/(2*(1-x)) )); // G. C. Greubel, Oct 20 2023
    
  • Maple
    # Using function CompInv from A357588.
    CompInv(34, n -> ifelse(n=-1, 1, combinat:-fibonacci(n-2))); # Peter Luschny, Oct 05 2022
  • Mathematica
    CoefficientList[Series[(1+x-Sqrt[1-2*x+5*x^2])/(2*x*(1-x)), {x, 0, 20}], x] (* Vaclav Kotesovec, Feb 08 2014 *)
    a[ n_] := SeriesCoefficient[ (1 + x - Sqrt[1 - 2 x + 5 x^2]) / (2 (1 - x)), {x, 0, n}]; (* Michael Somos, May 19 2014 *)
    a[ n_] := If[ n < 1, 0, SeriesCoefficient[ InverseSeries[ Series[ (x - x^2) / (1 - x - x^2), {x, 0, n}]], {x, 0, n}]]; (* Michael Somos, May 19 2014 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( (1 + x - sqrt(1 - 2*x + 5*x^2 + x^2 * O(x^n))) / (2 * (1 - x)), n))}; /* Michael Somos, May 19 2014 */
    
  • PARI
    {b(n) = if( n<1, 0, polcoeff( serreverse( (x - x^2) / (1 - x - x^2) + x * O(x^n)), n))}; /* Michael Somos, May 19 2014 */
    
  • SageMath
    def A108623_list(prec):
        P. = PowerSeriesRing(ZZ, prec)
        return P( (1+x-sqrt(1-2*x+5*x^2))/(2*(1-x)) ).list()
    a=A108623_list(41); a[1:] # G. C. Greubel, Oct 20 2023

Formula

Binomial transform of A105523. - Paul Barry, Nov 01 2006
G.f.: (1+x-sqrt(1-2*x+5*x^2))/(2*(1-x)). - Paul Barry, Nov 01 2006
Conjecture: n*a(n) +3*(1-n)*a(n-1) +(7*n-18)*a(n-2) +5*(3-n)*a(n-3)=0. - R. J. Mathar, Nov 15 2011
Lim sup_{n->infinity} |a(n)|^(1/n) = sqrt(5). - Vaclav Kotesovec, Feb 08 2014
Series reversion of g.f. of A212804. - Michael Somos, May 19 2014
G.f.: x / (1 - x + x /(1 - x / (1 - x + x / (1 - x / ...)))). - Michael Somos, May 19 2014
0 = a(n)*(25*a(n+1) - 50*a(n+2) + 45*a(n+3) - 20*a(n+4)) + a(n+1)*(-20*a(n+1) + 34*a(n+2) - 44*a(n+3) + 25*a(n+4)) + a(n+2)*(12*a(n+2) - 2*a(n+3) - 6*a(n+4)) + a(n+3)*(a(n+4)) if n>=0. - Michael Somos, May 19 2014

A245564 a(n) = Product_{i in row n of A245562} Fibonacci(i+2).

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 3, 5, 2, 4, 4, 6, 3, 6, 5, 8, 2, 4, 4, 6, 4, 8, 6, 10, 3, 6, 6, 9, 5, 10, 8, 13, 2, 4, 4, 6, 4, 8, 6, 10, 4, 8, 8, 12, 6, 12, 10, 16, 3, 6, 6, 9, 6, 12, 9, 15, 5, 10, 10, 15, 8, 16, 13, 21, 2, 4, 4, 6, 4, 8, 6, 10, 4, 8, 8, 12, 6, 12, 10, 16, 4, 8, 8, 12, 8, 16, 12, 20, 6, 12, 12, 18
Offset: 0

Views

Author

N. J. A. Sloane, Aug 10 2014; revised Sep 05 2014

Keywords

Comments

This is the Run Length Transform of S(n) = Fibonacci(n+2).
The Run Length Transform of a sequence {S(n), n>=0} is defined to be the sequence {T(n), n>=0} given by T(n) = Product_i S(i), where i runs through the lengths of runs of 1's in the binary expansion of n. E.g. 19 is 10011 in binary, which has two runs of 1's, of lengths 1 and 2. So T(19) = S(1)*S(2). T(0)=1 (the empty product).
Also the number of sparse subsets of the binary indices of n, where a set is sparse iff 1 is not a first difference. The maximal case is A384883. For prime instead of binary indices we have A166469. - Gus Wiseman, Jul 05 2025

Examples

			From _Gus Wiseman_, Jul 05 2025: (Start)
The binary indices of 11 are {1,2,4}, with sparse subsets {{},{1},{2},{4},{1,4},{2,4}}, so a(11) = 6.
The maximal runs of binary indices of 11 are ((1,2),(4)), with lengths (2,1), so a(11) = F(2+2)*F(1+2) = 6.
The a(0) = 1 through a(12) = 3 sparse subsets are:
  0    1    2    3    4    5    6    7    8    9    10    11    12
  ------------------------------------------------------------------
  {}   {}   {}   {}   {}   {}   {}   {}   {}   {}    {}    {}    {}
       {1}  {2}  {1}  {3}  {1}  {2}  {1}  {4}  {1}   {2}   {1}   {3}
                 {2}       {3}  {3}  {2}       {4}   {4}   {2}   {4}
                           {1,3}     {3}       {1,4} {2,4} {4}
                                     {1,3}                 {1,4}
                                                           {2,4}
The greatest number whose set of binary indices is a member of column n above is A374356(n).
(End)
		

Crossrefs

A034839 counts subsets by number of maximal runs, strict partitions A116674.
A384877 gives lengths of maximal anti-runs of binary indices, firsts A384878.
A384893 counts subsets by number of maximal anti-runs, for partitions A268193, A384905.

Programs

  • Maple
    with(combinat); ans:=[];
    for n from 0 to 100 do lis:=[]; t1:=convert(n,base,2); L1:=nops(t1); out1:=1; c:=0;
    for i from 1 to L1 do
       if out1 = 1 and t1[i] = 1 then out1:=0; c:=c+1;
       elif out1 = 0 and t1[i] = 1 then c:=c+1;
       elif out1 = 1 and t1[i] = 0 then c:=c;
       elif out1 = 0 and t1[i] = 0 then lis:=[c,op(lis)]; out1:=1; c:=0;
       fi;
       if i = L1 and c>0 then lis:=[c,op(lis)]; fi;
                       od:
    a:=mul(fibonacci(i+2), i in lis);
    ans:=[op(ans),a];
    od:
    ans;
  • Mathematica
    a[n_] := Sum[Mod[Binomial[3k, k] Binomial[n, k], 2], {k, 0, n}];
    a /@ Range[0, 100] (* Jean-François Alcover, Feb 29 2020, after Chai Wah Wu *)
    spars[S_]:=Select[Subsets[S],FreeQ[Differences[#],1]&];
    bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    Table[Length[spars[bpe[n]]],{n,0,30}] (* Gus Wiseman, Jul 05 2025 *)
  • PARI
    a(n)=my(s=1,k); while(n, n>>=valuation(n,2); k=valuation(n+1,2); s*=fibonacci(k+2); n>>=k); s \\ Charles R Greathouse IV, Oct 21 2016
    
  • Python
    # use RLT function from A278159
    from sympy import fibonacci
    def A245564(n): return RLT(n,lambda m: fibonacci(m+2)) # Chai Wah Wu, Feb 04 2022

Formula

a(n) = Sum_{k=0..n} ({binomial(3k,k)*binomial(n,k)} mod 2). - Chai Wah Wu, Oct 19 2016

A202023 Triangle T(n,k), read by rows, given by (1, 0, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 3, 0, 0, 1, 6, 1, 0, 0, 1, 10, 5, 0, 0, 0, 1, 15, 15, 1, 0, 0, 0, 1, 21, 35, 7, 0, 0, 0, 0, 1, 28, 70, 28, 1, 0, 0, 0, 0, 1, 36, 126, 84, 9, 0, 0, 0, 0, 0, 1, 45, 210, 210, 45, 1, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Dec 10 2011

Keywords

Comments

Riordan array (1/(1-x), x^2/(1-x)^2).
A skewed version of triangular array A085478.
Mirror image of triangle in A098158.
Sum_{k, 0<=k<=n} T(n,k)*x^k = A138229(n), A006495(n), A138230(n),A087455(n), A146559(n), A000012(n), A011782(n), A001333(n),A026150(n), A046717(n), A084057(n), A002533(n), A083098(n),A084058(n), A003665(n), A002535(n), A133294(n), A090042(n),A125816(n), A133343(n), A133345(n), A120612(n), A133356(n), A125818(n) for x = -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18 respectively.
Sum_{k, 0<=k<=n} T(n,k)*x^(n-k) = A009116(n), A000007(n), A011782(n), A006012(n), A083881(n), A081335(n), A090139(n), A145301(n), A145302(n), A145303(n), A143079(n) for x = -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 respectively.
From Gus Wiseman, Jul 08 2025: (Start)
After the first row this is also the number of subsets of {1..n-1} with k maximal runs (sequences of consecutive elements increasing by 1) for k = 0..n. For example, row n = 5 counts the following subsets:
{} {1} {1,3} . . .
{2} {1,4}
{3} {2,4}
{4} {1,2,4}
{1,2} {1,3,4}
{2,3}
{3,4}
{1,2,3}
{2,3,4}
{1,2,3,4}
Requiring n-1 gives A202064.
For anti-runs instead of runs we have A384893.
(End)

Examples

			Triangle begins :
1
1, 0
1, 1, 0
1, 3, 0, 0
1, 6, 1, 0, 0
1, 10, 5, 0, 0, 0
1, 15, 15, 1, 0, 0, 0
1, 21, 35, 7, 0, 0, 0, 0
1, 28, 70, 28, 1, 0, 0, 0, 0
		

Crossrefs

Column k = 1 is A000217.
Column k = 2 is A000332.
Row sums are A011782 (or A000079 shifted right).
Removing all zeros gives A034839 (requiring n-1 A034867).
Last nonzero term in each row appears to be A093178, requiring n-1 A124625.
Reversing rows gives A098158, without zeros A109446.
Without the k = 0 column we get A210039.
Row maxima appear to be A214282.
A116674 counts strict partitions by number of maximal runs, for anti-runs A384905.
A268193 counts integer partitions by number of maximal runs, for anti-runs A384881.

Programs

  • Mathematica
    Table[Length[Select[Subsets[Range[n-1]],Length[Split[#,#2==#1+1&]]==k&]],{n,0,10},{k,0,n}] (* Gus Wiseman, Jul 08 2025 *)

Formula

T(n,k) = binomial(n,2k).
G.f.: (1-x)/((1-x)^2-y*x^2).
T(n,k)= Sum_{j, j>=0} T(n-1-j,k-1)*j with T(n,0)=1 and T(n,k)= 0 if k<0 or if n
T(n,k) = 2*T(n-1,k) + T(n-2,k-1) - T(n-2,k) for n>1, T(0,0) = T(1,0) = 1, T(1,1) = 0, T(n,k) = 0 if k>n or if k<0. - Philippe Deléham, Nov 10 2013
Showing 1-10 of 14 results. Next