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.

Previous Showing 11-16 of 16 results.

A323951 Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.

Original entry on oeis.org

1, 0, 0, 1, 1, 1, 4, 8, 13, 22, 36, 56, 86, 131, 197, 294, 437, 647, 955, 1407, 2070, 3042, 4467, 6556, 9618, 14106, 20684, 30325, 44455, 65164, 95515, 139997, 205189, 300733, 440760, 645980, 946745, 1387538, 2033552, 2980332, 4367906, 6401495, 9381865, 13749810
Offset: 0

Views

Author

Gus Wiseman, Feb 10 2019

Keywords

Examples

			The a(3) = 1 through a(7) = 8 partitions:
  {{123}}  {{1234}}  {{12345}}  {{123456}}    {{1234567}}
                                {{123}{456}}  {{123}{4567}}
                                {{126}{345}}  {{1234}{567}}
                                {{156}{234}}  {{1237}{456}}
                                              {{1267}{345}}
                                              {{127}{3456}}
                                              {{1567}{234}}
                                              {{167}{2345}}

Links

Crossrefs

Cf. A000325, A001610, A001680, A005251, A066982, A306351, A323950, A323952, A323954.

Programs

  • Mathematica
    cycedsprop[n_,k_]:=Union[Sort/@Join@@Table[1+Mod[Range[i,j]-1,n],{i,n},{j,i+k,n+i-1}]];
spsu[,{}]:={{}};spsu[foo,set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsu[Select[foo,Complement[#,Complement[set,s]]=={}&],Complement[set,s]]]/@Cases[foo,{i,_}];
Table[Length[spsu[cycedsprop[n,2],Range[n]]],{n,15}]

Formula

G.f.: (x^7-2*x^6+x^3-3*x^2+3*x-1)/((x^3+x-1)*(x-1)^2). - Alois P. Heinz, Feb 10 2019

Extensions

More terms from Alois P. Heinz, Feb 10 2019

A323953 Regular triangle read by rows where T(n, k) is the number of ways to split an n-cycle into singletons and connected subsequences of sizes > k.

Original entry on oeis.org

1, 2, 1, 5, 2, 1, 12, 6, 2, 1, 27, 12, 7, 2, 1, 58, 23, 14, 8, 2, 1, 121, 44, 23, 16, 9, 2, 1, 248, 82, 38, 26, 18, 10, 2, 1, 503, 149, 65, 38, 29, 20, 11, 2, 1, 1014, 267, 112, 57, 42, 32, 22, 12, 2, 1, 2037, 475, 189, 90, 57, 46, 35, 24, 13, 2, 1
Offset: 1

Views

Author

Gus Wiseman, Feb 10 2019

Keywords

Examples

			Triangle begins:
     1
     2    1
     5    2    1
    12    6    2    1
    27   12    7    2    1
    58   23   14    8    2    1
   121   44   23   16    9    2    1
   248   82   38   26   18   10    2    1
   503  149   65   38   29   20   11    2    1
  1014  267  112   57   42   32   22   12    2    1
  2037  475  189   90   57   46   35   24   13    2    1
  4084  841  312  146   80   62   50   38   26   14    2    1
Row 4 counts the following connected partitions:
  {{1234}}        {{1234}}        {{1234}}        {{1}{2}{3}{4}}
  {{1}{234}}      {{1}{234}}      {{1}{2}{3}{4}}
  {{12}{34}}      {{123}{4}}
  {{123}{4}}      {{124}{3}}
  {{124}{3}}      {{134}{2}}
  {{134}{2}}      {{1}{2}{3}{4}}
  {{14}{23}}
  {{1}{2}{34}}
  {{1}{23}{4}}
  {{12}{3}{4}}
  {{14}{2}{3}}
  {{1}{2}{3}{4}}

Links

Crossrefs

First column is A000325. Second column is A323950.
Cf. A001610, A001680, A005251, A066982, A306351, A323951, A323952, A323954.

Programs

  • Mathematica
    cyceds[n_,k_]:=Union[Sort/@Join@@Table[1+Mod[Range[i,j]-1,n],{i,n},{j,Prepend[Range[i+k,n+i-1],i]}]];
spsu[,{}]:={{}};spsu[foo,set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsu[Select[foo,Complement[#,Complement[set,s]]=={}&],Complement[set,s]]]/@Cases[foo,{i,_}];
Table[Length[spsu[cyceds[n,k],Range[n]]],{n,10},{k,n}]
  • PARI
    T(n,k) = {1 + if(kAndrew Howroyd, Jan 19 2023

Formula

T(n,k) = 2 - n + Sum_{i=1..floor(n/k)} n*binomial(n-i*k+i-1, 2*i-1)/i for 1 <= k < n. - Andrew Howroyd, Jan 19 2023

A210673 a(n) = a(n-1)+a(n-2)+n-4, a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, -1, -1, -2, -2, -2, -1, 1, 5, 12, 24, 44, 77, 131, 219, 362, 594, 970, 1579, 2565, 4161, 6744, 10924, 17688, 28633, 46343, 74999, 121366, 196390, 317782, 514199, 832009, 1346237, 2178276, 3524544, 5702852, 9227429, 14930315, 24157779, 39088130, 63245946
Offset: 0

Views

Author

Alex Ratushnyak, May 09 2012

Keywords

Comments

Second differences are Fibonacci numbers A000045 with offset -4. - Olivier Gérard, Aug 21 2016

Links

Crossrefs

Cf. A066982: a(n)=a(n-1)+a(n-2)+n-2, a(0)=0, a(1)=1 (except the first term).
Cf. A104161: a(n)=a(n-1)+a(n-2)+n-1, a(0)=0, a(1)=1.
Cf. A001924: a(n)=a(n-1)+a(n-2)+n, a(0)=0, a(1)=1.
Cf. A192760: a(n)=a(n-1)+a(n-2)+n+1, a(0)=0, a(1)=1.
Cf. A192761: a(n)=a(n-1)+a(n-2)+n+2, a(0)=0, a(1)=1.
Cf. A192762: a(n)=a(n-1)+a(n-2)+n+3, a(0)=0, a(1)=1.
Cf. A210675: a(n)=a(n-1)+a(n-2)+n+4, a(0)=0, a(1)=1.

Programs

  • Mathematica
    RecurrenceTable[{a[0]==0,a[1]==1,a[n]==a[n-1]+a[n-2]+n-4},a,{n,50}] (* or *) LinearRecurrence[{3,-2,-1,1},{0,1,-1,-1},50] (* Harvey P. Dale, Oct 03 2012 *)

Formula

a(0)=0, a(1)=1, a(2)=-1, a(3)=-1, a(n) = 3*a(n-1)-2*a(n-2)-a(n-3)+a(n-4). - Harvey P. Dale, Oct 03 2012
G.f.: x/Q(0), where Q(k)= 1 + (k+1)*x/(1 - x - x*(1-x)/(x + (k+1)*(1-x)/Q(k+1))); (continued fraction). - Sergei N. Gladkovskii, Apr 24 2013
G.f.: -x*(2*x-1)^2 / ((x-1)^2*(x^2+x-1)). - Colin Barker, May 31 2013

A210677 a(n) = a(n-1) + a(n-2) + n + 1, a(0) = a(1) = 1.

Original entry on oeis.org

1, 1, 5, 10, 20, 36, 63, 107, 179, 296, 486, 794, 1293, 2101, 3409, 5526, 8952, 14496, 23467, 37983, 61471, 99476, 160970, 260470, 421465, 681961, 1103453, 1785442, 2888924, 4674396, 7563351, 12237779, 19801163, 32038976, 51840174, 83879186, 135719397, 219598621, 355318057
Offset: 0

Views

Author

Alex Ratushnyak, May 09 2012

Keywords

Links

Crossrefs

Cf. A081659: a(n)=a(n-1)+a(n-2)+n-5, a(0)=a(1)=1 (except first 2 terms and sign).
Cf. A001924: a(n)=a(n-1)+a(n-2)+n-4, a(0)=a(1)=1 (except first 4 terms).
Cf. A000126: a(n)=a(n-1)+a(n-2)+n-2, a(0)=a(1)=1 (except first term).
Cf. A066982: a(n)=a(n-1)+a(n-2)+n-1, a(0)=a(1)=1.
Cf. A030119: a(n)=a(n-1)+a(n-2)+n, a(0)=a(1)=1.
Cf. A210678: a(n)=a(n-1)+a(n-2)+n+2, a(0)=a(1)=1.

Programs

Formula

From Colin Barker, Jun 30 2012: (Start)
a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4).
G.f.: (1 - 2*x + 4*x^2 - 2*x^3)/((1 - x)^2*(1 - x - x^2)). (End)
E.g.f.: exp(x/2)*(25*cosh(sqrt(5)*x/2) + 7*sqrt(5)*sinh(sqrt(5)*x/2))/5 - exp(x)*(4 + x). - Stefano Spezia, Feb 24 2023

A210675 a(n)=a(n-1)+a(n-2)+n+4, a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 7, 15, 30, 54, 94, 159, 265, 437, 716, 1168, 1900, 3085, 5003, 8107, 13130, 21258, 34410, 55691, 90125, 145841, 235992, 381860, 617880, 999769, 1617679, 2617479, 4235190, 6852702, 11087926, 17940663, 29028625, 46969325, 75997988, 122967352, 198965380
Offset: 0

Views

Author

Alex Ratushnyak, May 09 2012

Keywords

Links

Crossrefs

Cf. A210673: a(n)=a(n-1)+a(n-2)+n-4, a(0)=0,a(1)=1.
Cf. A066982: a(n)=a(n-1)+a(n-2)+n-2, a(0)=0,a(1)=1 (except the first term).
Cf. A104161: a(n)=a(n-1)+a(n-2)+n-1, a(0)=0,a(1)=1.
Cf. A001924: a(n)=a(n-1)+a(n-2)+n, a(0)=0,a(1)=1.
Cf. A192760: a(n)=a(n-1)+a(n-2)+n+1, a(0)=0,a(1)=1.
Cf. A192761: a(n)=a(n-1)+a(n-2)+n+2, a(0)=0,a(1)=1.
Cf. A192762: a(n)=a(n-1)+a(n-2)+n+3, a(0)=0,a(1)=1.

Programs

Formula

a(n) = 3*a(n-1)-2*a(n-2)-a(n-3)+a(n-4). G.f.: x*(4*x^2-4*x-1) / ((x-1)^2*(x^2+x-1)). - Colin Barker, May 31 2013

A210678 a(n) = a(n-1)+a(n-2)+n+2, a(0)=a(1)=1.

Original entry on oeis.org

1, 1, 6, 12, 24, 43, 75, 127, 212, 350, 574, 937, 1525, 2477, 4018, 6512, 10548, 17079, 27647, 44747, 72416, 117186, 189626, 306837, 496489, 803353, 1299870, 2103252, 3403152, 5506435, 8909619, 14416087, 23325740, 37741862, 61067638, 98809537, 159877213, 258686789, 418564042
Offset: 0

Views

Author

Alex Ratushnyak, May 09 2012

Keywords

Links

Crossrefs

Cf. A081659: a(n)=a(n-1)+a(n-2)+n-5, a(0)=a(1)=1 (except first 2 terms and sign).
Cf. A001924: a(n)=a(n-1)+a(n-2)+n-4, a(0)=a(1)=1 (except first 4 terms).
Cf. A000126: a(n)=a(n-1)+a(n-2)+n-2, a(0)=a(1)=1 (except first term).
Cf. A066982: a(n)=a(n-1)+a(n-2)+n-1, a(0)=a(1)=1.
Cf. A030119: a(n)=a(n-1)+a(n-2)+n, a(0)=a(1)=1.
Cf. A210677: a(n)=a(n-1)+a(n-2)+n+1, a(0)=a(1)=1.

Programs

  • Mathematica
    LinearRecurrence[{3,-2,-1,1},{1,1,6,12},40] (* Harvey P. Dale, Dec 10 2014 *)
nxt[{n_,a_,b_}]:={n+1,b,a+b+n+3}; NestList[nxt,{1,1,1},40][[;;,2]] (* Harvey P. Dale, Mar 19 2023 *)

Formula

From Colin Barker, Jun 30 2012: (Start)
a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4).
G.f.: (1 -2*x + 5*x^2 - 3*x^3)/((1 - x)^2*(1 - x - x^2)). (End)
Previous Showing 11-16 of 16 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.