A049016 -id:A049016 - cp's OEIS frontend

A024495 a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).

0, 0, 1, 3, 6, 11, 21, 42, 85, 171, 342, 683, 1365, 2730, 5461, 10923, 21846, 43691, 87381, 174762, 349525, 699051, 1398102, 2796203, 5592405, 11184810, 22369621, 44739243, 89478486, 178956971, 357913941, 715827882, 1431655765, 2863311531, 5726623062

Offset: 0

Clark Kimberling

Trisections give A082365, A132804, A132805. - Paul Curtz, Nov 18 2007
If the offset is changed to 1, this is the maximal number of closed regions bounded by straight lines after n straight line cuts in a plane: a(n) = a(n-1) + n - 3, a(1)=0; a(2)=0; a(3)=1; and so on. - Srikanth K S, Jan 23 2008
M^n * [1,0,0] = [A024493(n), a(n), A024494(n)]; where M = a 3x3 matrix [1,1,0; 0,1,1; 1,0,1]. Sum of terms = 2^n. Example: M^5 * [1,0,0] = [11, 11, 10], sum = 2^5 = 32. - Gary W. Adamson, Mar 13 2009
For n>=1, a(n-1) is the number of generalized compositions of n when there are i^2/2 - 3*i/2 + 1 different types of i, (i=1,2,...). - Milan Janjic, Sep 24 2010
Let M be any endomorphism on any vector space, such that M^3 = 1 (identity). Then (1+M)^n = A024493(n) + A024494(n)*M + a(n)*M^2. - Stanislav Sykora, Jun 10 2012
{A024493, A131708, A024495} is the difference analog of the hyperbolic functions {h_1(x), h_2(x), h_3(x)} of order 3. For the definitions of {h_i(x)} and the difference analog {H_i(n)} see [Erdelyi] and the Shevelev link respectively. - Vladimir Shevelev, Aug 01 2017
This is the p-INVERT of (1,1,1,1,1,...) for p(S) = 1 - S^3; see A291000.  - Clark Kimberling, Aug 24 2017

A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, Chapter XVIII.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 1, 2nd. ed., Problem 38, p. 70.

Seiichi Manyama, Table of n, a(n) for n = 0..3000
Paul Barry, A note on Krawtchouk Polynomials and Riordan Arrays, JIS 11 (2008) 08.2.2, example 9.
Antoine-Augustin Cournot, Solution d'un problème d'analyse combinatoire, Bulletin des Sciences Mathématiques, Physiques et Chimiques, item 34, volume 11, 1829, pages 93-97. Also at Google Books. Page 97 case p=3 formula y^(2) = a(n).
Christian Ramus, Solution générale d'un problème d'analyse combinatoire, Journal für die Reine und Angewandte Mathematik (Crelle's journal), volume 11, 1834, pages 353-355. Page 353 case p=3 formula y^(2) = a(n).
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Eric Weisstein's World of Mathematics, Plane division by lines
Index entries for linear recurrences with constant coefficients, signature (3,-3,2).

Cf. A007283, A010892, A011655, A024493, A024494, A024495, A057079, A082365.
Cf. A083322, A139469, A111927, A113405, A131577, A131708, A132804, A132805.
Cf. A175805, A291000.
Sequences of the form 1/((1-x)^m - x^m): A000079 (m=1,2), this sequence (m=3), A000749 (m=4), A049016 (m=5), A192080 (m=6), A049017 (m=7), A290995 (m=8), A306939 (m=9).

R:=PowerSeriesRing(Integers(), 30); [0,0] cat Coefficients(R!( x^2/((1-x)^3-x^3) )); // G. C. Greubel, Apr 11 2023

a:= proc(n) option remember; `if`(n=0, 0, 2*a(n-1)+
      [-1, 0, 1, 1, 0, -1, -1][1+(n mod 6)])
    end:
seq(a(n), n=0..33); # Paul Weisenhorn, May 17 2020

LinearRecurrence[{3,-3,2},{0,0,1},40] (* Harvey P. Dale, Sep 20 2016 *)

a(n) = sum(k=0,n\3,binomial(n,3*k+2)) /* Michael Somos, Feb 14 2006 */

a(n)=if(n<0, 0, ([1,0,1;1,1,0;0,1,1]^n)[3,1]) /* Michael Somos, Feb 14 2006 */

def A024495(n): return (2^n - chebyshev_U(n, 1/2) - chebyshev_U(n-1, 1/2))/3
[A024495(n) for n in range(41)] # G. C. Greubel, Apr 11 2023

a(n) = ( 2^n + 2*cos((n-4)*Pi/3) )/3 = (2^n - A057079(n))/3.
a(n) = 2*a(n-1) + A010892(n-2) = a(n-1) + A024494(n-1). With initial zero, binomial transform of A011655 which is effectively A010892 unsigned. - Henry Bottomley, Jun 04 2001
a(2) = 1, a(3) = 3, a(n+2) = a(n+1) - a(n) + 2^n. - Benoit Cloitre, Sep 04 2002
a(n) = Sum_{k=0..n} 2^k*2*sin(Pi*(n-k)/3 + Pi/3)/sqrt(3) (offset 0). - Paul Barry, May 18 2004
G.f.: x^2/((1-x)^3 - x^3) =  x^2 / ( (1-2*x)*(1-x+x^2) ).
a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3). - Paul Curtz, Nov 18 2007
a(n) + A024493(n-1) = A131577(n). - Paul Curtz, Jan 24 2008
From Paul Curtz, May 29 2011: (Start)
a(n) + a(n+3) = 3*2^n = A007283(n).
a(n+6) - a(n) = 21*2^n = A175805(n).
a(n) + a(n+9) = 171*2^n.
a(n+12) - a(n) = 1365*2^n. (End)
a(n) = A113405(n) + A113405(n+1). - Paul Curtz, Jun 05 2011
Start with x(0)=1, y(0)=0, z(0)=0 and set x(n+1) = x(n) + z(n), y(n+1) = y(n) + x(n), z(n+1) = z(n) + y(n). Then a(n) = z(n). - Stanislav Sykora, Jun 10 2012
G.f.: -x^2/( x^3 - 1 + 3*x/Q(0) ) where Q(k) = 1 + k*(x+1) + 3*x - x*(k+1)*(k+4)/Q(k+1) ; (continued fraction). - Sergei N. Gladkovskii, Mar 15 2013
a(n) = 1/18*(-4*(-1)^floor((n - 1)/3) - 6*(-1)^floor(n/3) - 3*(-1)^floor((n + 1)/3) + (-1)^(1 + floor((n + 2)/3)) + 3*2^(n + 1)). - John M. Campbell, Dec 23 2016
a(n) = (1/63)*(-40 + 21*2^n - 42*floor(n/6) + 32*floor((n+3)/6) + 16*floor((n+ 4)/6) - 24*floor((n+5)/6) - 22*floor((n+7)/6) + 21*floor((n+8)/6) + 10*floor((n+9)/6) + 5*floor((n+10)/6) + 3*floor((n+11)/6) + floor((n+ 13)/6)). - John M. Campbell, Dec 24 2016
a(n+m) = a(n)*A024493(m) + A131708(n)*A131708(m) + A024493(n)*a(m). - Vladimir Shevelev, Aug 01 2017
From Kevin Ryde, Sep 24 2020: (Start)
a(n) = (1/3)*2^n - (1/3)*cos((1/3)*Pi*n) - (1/sqrt(3))*sin((1/3)*Pi*n). [Cournot]
a(n) + A111927(n) + A131708(n) = 2^n - 1. [Cournot, page 96 last formula, but misprint should be 2^x - 1 rather than 2^p - 1] (End)
E.g.f.: (exp(2*x) - exp(x/2)*(cos(sqrt(3)*x/2) + sqrt(3)*sin(sqrt(3)*x/2)))/3. - Stefano Spezia, Feb 06 2025

A000749 a(n) = 4a(n-1) - 6a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.

Original entry on oeis.org

0, 0, 0, 1, 4, 10, 20, 36, 64, 120, 240, 496, 1024, 2080, 4160, 8256, 16384, 32640, 65280, 130816, 262144, 524800, 1049600, 2098176, 4194304, 8386560, 16773120, 33550336, 67108864, 134225920, 268451840, 536887296, 1073741824, 2147450880

Offset: 0

N. J. A. Sloane

Number of strings over Z_2 of length n with trace 1 and subtrace 1.
Same as number of strings over GF(2) of length n with trace 1 and subtrace 1.
Also expansion of bracket function.
a(n) is also the number of induced subgraphs with odd number of edges in the complete graph K(n-1). - Alessandro Cosentino (cosenal(AT)gmail.com), Feb 02 2009
From Gary W. Adamson, Mar 13 2009: (Start)
M^n * [1,0,0,0] = [A038503(n), a(n), A038505(n), A038504(n)];
where M = the 4 X 4 matrix [1,1,0,0; 0,1,1,0; 0,0,1,1; 1,0,0,1].
Sum of the 4 terms = 2^n.
Example; M^6 * [1,0,0,0] = [16, 20, 16, 12] sum = 64 = 2^6. (End)
Binomial transform of the period 4 repeat: [0,0,0,1], which is the same as A011765 with offset 0. - Wesley Ivan Hurt, Dec 30 2015
{A038503, A038504, A038505, A000749} is the difference analog of the hyperbolic functions of order 4, {h_1(x), h_2(x), h_3(x), h_4(x)}. For a definition see the reference "Higher Transcendental Functions" and the Shevelev link. - Vladimir Shevelev, Jun 14 2017
This is the p-INVERT of (1,1,1,1,1,...) for p(S) = 1 - S^4; see A291000.  - Clark Kimberling, Aug 24 2017

			a(4;1,1)=4 since the four binary strings of trace 1, subtrace 1 and length 4 are { 0111, 1011, 1101, 1110 }.

Higher Transcendental Functions, Bateman Manuscript Project, Vol. 3, ed. A. Erdelyi, 1983 (chapter XVIII).
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..200
H. W. Gould, Binomial coefficients, the bracket function and compositions with relatively prime summands, Fib. Quart. 2(4) (1964), 241-260.
Maran van Heesch, The multiplicative complexity of symmetric functions over a field with characteristic p, Thesis, 2014.
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.
F. Ruskey, Strings over Z_2 with given trace and subtrace
F. Ruskey, Strings over GF(2) with given trace and subtrace
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4).

Cf. A000748, A000750, A001659, A006090, A007877, A009545, A011765.
Cf. A021913, A038503, A038504, A038505, A133209, A133212, A291000.
Sequences of the form 1/((1-x)^m - x^m): A000079 (m=1,2), A024495 (m=3), this sequence (m=4), A049016 (m=5), A192080 (m=6), A049017 (m=7), A290995 (m=8), A306939 (m=9).

a000749 n = a000749_list !! n
a000749_list = 0 : 0 : 0 : 1 : zipWith3 (\u v w -> 4 * u - 6 * v + 4 * w)
   (drop 3 a000749_list) (drop 2 a000749_list) (drop 1 a000749_list)
-- Reinhard Zumkeller, Jul 15 2013

I:=[0,0,0,1]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3): n in [1..40]]; // Vincenzo Librandi, Dec 31 2015

A000749 := proc(n) local k; add(binomial(n,4*k+3),k=0..floor(n/4)); end;
A000749:=-1/((2*z-1)*(2*z**2-2*z+1)); # Simon Plouffe in his 1992 dissertation
a:= n-> if n=0 then 0 else (Matrix(3, (i,j)-> if (i=j-1) then 1 elif j=1 then [4,-6,4][i] else 0 fi)^(n-1))[1,3] fi: seq(a(n), n=0..33); # Alois P. Heinz, Aug 26 2008
# Alternatively:
s := sqrt(2): h := n -> [0,-s,-2,-s,0,s,2,s][1+(n mod 8)]:
a := n -> `if`(n=0,0,(2^n+2^(n/2)*h(n))/4):
seq(a(n),n=0..33); # Peter Luschny, Jun 14 2017

Join[{0},LinearRecurrence[{4,-6,4},{0,0,1},40]] (* Harvey P. Dale, Mar 31 2012 *)
CoefficientList[Series[x^3/(1 -4x +6x^2 -4x^3), {x,0,80}], x] (* Vincenzo Librandi, Dec 31 2015 *)

PARI
```
a(n)=sum(k=0,n\4,binomial(n,4*k+3))
```

@CachedFunction
def a(n): # a = A000749
    if (n<4): return (n//3)
    else: return 4*a(n-1) -6*a(n-2) +4*a(n-3)
[a(n) for n in range(41)] # G. C. Greubel, Apr 11 2023

G.f.: x^3/((1-x)^4 - x^4).
a(n) = Sum_{k=0..n} binomial(n, 4*k+3).
a(n) = a(n-1) + A038505(n-2) = 2*a(n-1) + A009545(n-2) for n>=2.
Without the two initial zeros, binomial transform of A007877. - Henry Bottomley, Jun 04 2001
From Paul Barry, Aug 30 2004: (Start)
a(n) = (2^n - 2^(n/2+1)*sin(Pi*n/4) - 0^n)/4.
a(n+1) is the binomial transform of A021913. (End)
a(n; t, s) = a(n-1; t, s) + a(n-1; t+1, s+t+1) where t is the trace and s is the subtrace.
Without the initial three zeros, = binomial transform of [1, 3, 3, 1, 1, 3, 3, 1, 1, 3, 3, 1, 1, 3, 3, 1, 3, ...]. - Gary W. Adamson, Jun 19 2008
From Vladimir Shevelev, Jun 14 2017: (Start)
1) For n>=1, a(n) = (1/4)*(2^n + i*(1+i)^n - i*(1-i)^n), where i=sqrt(-1);
2) a(n+m) = a(n)*H_1(m) + H_3(n)*H_2(m) + H_2(n)*H_3(m) + H_1(n)*a(m),
where H_1 = A038503, H_2 = A038504, H_3 = A038505. (End)
a(n) = (2^n - 2*A009545(n) - [n=0])/4. - G. C. Greubel, Apr 11 2023

Additional comments from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Nov 22 2002
New definition from Paul Curtz, Oct 29 2007
Edited by N. J. A. Sloane, Jun 13 2008

A139761 a(n) = Sum_{k >= 0} binomial(n,5*k+4).

Original entry on oeis.org

0, 0, 0, 0, 1, 5, 15, 35, 70, 127, 220, 385, 715, 1430, 3004, 6385, 13380, 27370, 54740, 107883, 211585, 416405, 826045, 1652090, 3321891, 6690150, 13455325, 26985675, 53971350, 107746282, 214978335, 429124630, 857417220, 1714834440, 3431847189

Offset: 0

N. J. A. Sloane, Jun 13 2008

Sequence is identical to its fifth differences. - Paul Curtz, Jun 18 2008
{A139398, A133476, A139714, A139748, A139761} is the difference analog of the hyperbolic functions of order 5, {h_1(x), h_2(x), h_3(x), h_4(x), h_5 (x)}. For a definition see [Erdelyi] and the Shevelev link. - Vladimir Shevelev, Jun 28 2017
This is the p-INVERT of (1,1,1,1,1,...) for p(S) = 1 - S^5; see A291000.  - Clark Kimberling, Aug 24 2017

A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, Chapter XVIII.

Seiichi Manyama, Table of n, a(n) for n = 0..3000
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,2).

Cf. A049016, A133476, A139398, A139714, A139748, A139761.

I:=[0,0,0,0,1]; [n le 5 select I[n] else 5*Self(n-1)-10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+2*Self(n-5): n in [1..40]]; // Vincenzo Librandi, Dec 21 2015

a:= n-> (Matrix(5, (i, j)-> `if`((j-i) mod 5 in [0, 1], 1, 0))^n)[2, 1]:
seq(a(n), n=0..35);  # Alois P. Heinz, Dec 21 2015

CoefficientList[Series[x^4/((1-2x)(x^4-2x^3+4x^2-3x+1)), {x,0,40}], x] (* Vincenzo Librandi, Dec 21 2015 *)
LinearRecurrence[{5,-10,10,-5,2}, {0,0,0,0,1}, 35] (* Jean-François Alcover, Feb 14 2018 *)

a(n) = sum(k=0, n\5, binomial(n,5*k+4)); \\ Michel Marcus, Dec 21 2015

my(x='x+O('x^100)); concat([0,0,0,0], Vec(-x^4/((2*x-1)*(x^4-2*x^3 +4*x^2-3*x+1)))) \\ Altug Alkan, Dec 21 2015

def A139761(n): return sum(binomial(n,5*k+4) for k in range(1+n//5))
[A139761(n) for n in range(41)] # G. C. Greubel, Jan 23 2023

a(n) = A049016(n-4). - R. J. Mathar, Nov 08 2010
From Paul Curtz, Jun 18 2008: (Start)
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + 2*a(n-5).
a(n) = A139398(n+1) - A139398(n). (End)
G.f.: x^4/((1-2*x)*(1-3*x+4*x^2-2*x^3+x^4)). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009
a(n) = round((2/5)*(2^(n-1) + phi^n*cos(Pi*(n-8)/5))), where phi is the golden ratio, round(x) is the integer nearest to x. - Vladimir Shevelev, Jun 28 2017
a(n+m) = a(n)*H_1(m) + H_4(n)*H_2(m) + H_3(n)*H_3(m) + H_2(n)*H_4(m) + H_1(n)*a(m), where H_1=A139398, H_2=A133476, H_3=A139714, H_4=A139748. - Vladimir Shevelev, Jun 28 2017

A133476 a(n) = Sum_{k>=0} binomial(n,5*k+1).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 7, 14, 36, 93, 220, 474, 948, 1807, 3381, 6385, 12393, 24786, 50559, 103702, 211585, 427351, 854702, 1698458, 3368259, 6690150, 13333932, 26667864, 53457121, 107232053, 214978335, 430470899, 860941798, 1720537327, 3437550076, 6869397265

Offset: 0

Paul Curtz, Nov 29 2007

From Gary W. Adamson, Mar 14 2009: (Start)
M^n * [1,0,0,0,0] = [A139398(n), A139761(n), A139748(n), A139714(n), a(n)]
where M = a 5 X 5 matrix [1,1,0,0,0; 0,1,1,0,0; 0,0,1,1,0; 0,0,0,1,1; 1,0,0,0,1]
Sum of terms = 2^n. Example: M^6 * [1,0,0,0,0] = [7, 15, 20, 15, 7] = 2^6 = 64. (End)
{A139398, A133476, A139714, A139748, A139761} is the difference analog of the hyperbolic functions of order 5, {h_1(x), h_2(x), h_3(x), h_4(x), h_5 (x)}. For a definition see the reference "Higher Transcendental Functions" and the Shevelev link. - Vladimir Shevelev, Jun 18 2017

A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, Chapter XVIII.

Robert Israel, Table of n, a(n) for n = 0..3260
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,2).

Cf. A049016.

f:= gfun:-rectoproc({a(n)=5*a(n-1)-10*a(n-2)+10*a(n-3)-5*a(n-4)+2*a(n-5),
seq(a(i)=i,i=0..4)},a(n),remember):
map(f, [$0..30]); # Robert Israel, Dec 20 2015

LinearRecurrence[{5, -10, 10, -5, 2}, Range[0, 4], 40] (* Jean-François Alcover, Jul 10 2018 *)

a(n) = sum(k=0, n\5, binomial(n,5*k+1)); \\ Michel Marcus, Dec 21 2015

a(n) = 5a(n-1) - 10a(n-2) + 10a(n-3) - 5a(n-4) + 2a(n-5).
Sequence is identical to its fifth differences.
O.g.f.: x*(x-1)^3/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)) = (1/5)*(3*x^3-7*x^2+6*x-1)/(x^4-2*x^3+4*x^2-3*x+1)-(1/5)/(2*x-1). - R. J. Mathar, Nov 30 2007
Starting (1, 2, 3, 4, 5, 7, ...) = binomial transform of (1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, ...). - Gary W. Adamson, Jul 03 2008
a(n) = round((2/5)*(2^(n-1)+phi^n*cos(Pi*(n-2)/5))), where phi is the golden ratio, round(x) is the nearest to x integer. - Vladimir Shevelev, Jun 18 2017
a(n+m) = a(n)*H_1(m) + H_1(n)*H_2(m) + H_5(n)*H_3(m) + H_4(n)*H_4(m) + H_3(n)*H_5(m), where H_1=A139398, H_3=A139714, H_4=A139748, H_5=A139761. - Vladimir Shevelev, Jun 18 2017

Better definition from N. J. A. Sloane, Jun 13 2008

Edited by N. J. A. Sloane, Jul 02 2008 at the suggestion of R. J. Mathar

A139748 a(n) = Sum_{ k >= 0} binomial(n,5*k+3).

Original entry on oeis.org

0, 0, 0, 1, 4, 10, 20, 35, 57, 93, 165, 330, 715, 1574, 3381, 6995, 13990, 27370, 53143, 103702, 204820, 409640, 826045, 1669801, 3368259, 6765175, 13530350, 26985675, 53774932, 107232053, 214146295, 428292590, 857417220, 1717012749, 3437550076

Offset: 0

N. J. A. Sloane, Jun 13 2008

From Gary W. Adamson, Mar 14 2009: (Start)
M^n * [1,0,0,0,0] = [A139398(n), A139761(n), a(n), A139714(n), A133476(n)]
where M = a 5 X 5 matrix [1,1,0,0,0; 0,1,1,0,0; 0,0,1,1,0; 0,0,0,1,1; 1,0,0,0,1].
Sum of terms = 2^n. Example: M^6 * [1,0,0,0,0] = [7, 15, 20, 15, 7]; sum = 64. (End)
{A139398, A133476, A139714, A139748, A139761} is the difference analog of the hyperbolic functions of order 5, {h_1(x), h_2(x), h_3(x), h_4(x), h_5 (x)}. For a definition see [Erdelyi] and the Shevelev link. - Vladimir Shevelev, Jun 28 2017

A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, Chapter XVIII.

Seiichi Manyama, Table of n, a(n) for n = 0..3000
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,2).

Cf. A049016, A133476, A139714.

I:=[0,0,0,1,4]; [n le 5 select I[n] else 5*Self(n-1)- 10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+2*Self(n-5): n in [1..40]]; // Vincenzo Librandi, Dec 21 2015

a:= n-> (Matrix(5, (i, j)-> `if`((j-i) mod 5 in [0, 1], 1, 0))^n)[3, 1]:
seq(a(n), n=0..35);  # Alois P. Heinz, Dec 21 2015

CoefficientList[Series[x^3 (x - 1)/((2 x - 1) (x^4 - 2 x^3 + 4 x^2 - 3 x + 1)), {x, 0, 50}], x] (* Vincenzo Librandi, Dec 21 2015 *)

a(n) = sum(k=0, n\5, binomial(n,5*k+3)); \\ Michel Marcus, Dec 21 2015

x='x+O('x^100); concat([0, 0, 0], Vec(x^3*(x-1)/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)))) \\ Altug Alkan, Dec 21 2015

G.f.: x^3*(x-1)/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009
a(n) = round((2/5)*(2^(n-1) + phi^n*cos(Pi*(n-6)/5))), where phi is the golden ratio and round(x) is the integer nearest to x. - Vladimir Shevelev, Jun 28 2017
a(n+m) = a(n)*H_1(m) + H_3(n)*H_2(m) + H_2(n)*H_3(m) + H_1(n)*a(m) + H_5(n)*H_5(m), where H_1=A139398, H_2=A133476, H_3=A139714, H_5=A139761. - Vladimir Shevelev, Jun 28 2017

A139714 a(n) = Sum_{k>=0} binomial(n,5*k+2).

Original entry on oeis.org

0, 0, 1, 3, 6, 10, 15, 22, 36, 72, 165, 385, 859, 1807, 3614, 6995, 13380, 25773, 50559, 101118, 204820, 416405, 843756, 1698458, 3396916, 6765175, 13455325, 26789257, 53457121, 106914242, 214146295, 429124630, 859595529, 1720537327, 3441074654

Offset: 0

N. J. A. Sloane, Jun 13 2008

From Gary W. Adamson, Mar 14 2009: (Start)
M^n * [1,0,0,0,0] = [A139398(n), A139761(n), A139748(n), a(n), A133476(n)]
where M = a 5 X 5 matrix [1,1,0,0,0; 0,1,1,0,0; 0,0,1,1,0; 0,0,0,1,1; 1,0,0,0,1].
Sum of terms = 2^n. Example: M^6 = [7, 15, 20, 15, 7], sum = 2^6 = 64. (End)
{A139398, A133476, A139714, A139748, A139761} is the difference analog of the hyperbolic functions of order 5, {h_1(x), h_2(x), h_3(x), h_4(x), h_5 (x)}. For a definition see [Erdelyi] and the Shevelev link. - Vladimir Shevelev, Jun 18 2017

A. Erdelyi, Higher Transcendental Functions, McGraw-Hill, 1955, Vol. 3, Chapter XVIII.

Seiichi Manyama, Table of n, a(n) for n = 0..3000
Vladimir Shevelev, Combinatorial identities generated by difference analogs of hyperbolic and trigonometric functions of order n, arXiv:1706.01454 [math.CO], 2017.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,2).

Cf. A049016, A133476, A139748, A139761.

[n le 5 select (n-2)*(n-1)/2 else 5*Self(n-1)- 10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+2*Self(n-5): n in [1..40]]; // Vincenzo Librandi, Dec 21 2015

a:= n-> (Matrix(5, (i, j)-> `if`((j-i) mod 5 in [0, 1], 1, 0))^n)[4, 1]:
seq(a(n), n=0..35);  # Alois P. Heinz, Dec 21 2015

CoefficientList[Series[x^2 (x - 1)^2/((1 - 2 x) (x^4 - 2 x^3 + 4 x^2 - 3 x + 1)), {x, 0, 50}], x] (* Vincenzo Librandi, Dec 21 2015 *)

a(n) = sum(k=0, n\5, binomial(n,5*k+2)); \\ Michel Marcus, Dec 21 2015

x='x+O('x^100); concat([0, 0], Vec(-x^2*(x-1)^2/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)))) \\ Altug Alkan, Dec 21 2015

G.f.: -x^2*(x-1)^2/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009
a(n) = round((2/5)*(2^(n-1)+phi^n*cos(Pi*(n-4)/5))), where phi is the golden ratio, round(x) is the integer nearest to x. - Vladimir Shevelev, Jun 18 2017
a(n+m) = a(n)*H_1(m) + H_2(n)*H_2(m) + H_1(n)*a(m) + H_5(n)*H_4(m) + H_4(n)*H_5(m), where H_1=A139398, H_2=A133476, H_4=A139748, H_5=A139761. - Vladimir Shevelev, Jun 18 2017

A049017 Expansion of 1/((1-x)^7 - x^7).

Original entry on oeis.org

1, 7, 28, 84, 210, 462, 924, 1717, 3017, 5110, 8568, 14756, 27132, 54264, 116281, 257775, 572264, 1246784, 2641366, 5430530, 10861060, 21242341, 40927033, 78354346, 150402700, 291693136, 574274008, 1148548016, 2326683921, 4749439975, 9714753412, 19818498700, 40199107690

Offset: 0

N. J. A. Sloane

Differs for n >= 7 (1717 vs. 1716) from A000579(n+6) = binomial(n+6,6); see also row 6 of A027555, A059481 and A213808. - M. F. Hasler, Mar 05 2017

Seiichi Manyama, Table of n, a(n) for n = 0..3000
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,2).

Cf. A000579, A000750, A027555, A049018, A059481, A213808.

Sequences of the form 1/((1-x)^m - x^m): A000079 (m=1,2), A024495 (m=3), A000749 (m=4), A049016 (m=5), A192080 (m=6), this sequence (m=7), A290995 (m=8), A306939 (m=9).

R:=PowerSeriesRing(Integers(), 40); Coefficients(R!( 1/((1-x)^7 - x^7) )); // G. C. Greubel, Apr 11 2023

CoefficientList[Series[1/((1-x)^7-x^7),{x,0,30}],x]  (* Harvey P. Dale, Feb 18 2011 *)

Vec(1/((1-x)^7-x^7)+O(x^99)) \\ M. F. Hasler, Mar 05 2017

def A049017_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( 1/((1-x)^7 - x^7) ).list()
A049017_list(40) # G. C. Greubel, Apr 11 2023

G.f.: 1/((1-x)^7 - x^7) = 1/((1-2*x)*(1-5*x+11*x^2-13*x^3+9*x^4-3*x^5+x^6)).

A290995 p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - S^8.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 8, 36, 120, 330, 792, 1716, 3432, 6436, 11456, 19584, 32640, 54264, 93024, 170544, 341088, 735472, 1653632, 3749760, 8386560, 18289440, 38724480, 79594560, 159189120, 311058496, 597137408, 1133991936, 2147450880, 4089171840

Offset: 0

Clark Kimberling, Aug 22 2017

Suppose s = (c(0), c(1), c(2),...) is a sequence and p(S) is a polynomial. Let S(x) = c(0)*x + c(1)*x^2 + c(2)*x^3 + ... and T(x) = (-p(0) + 1/p(S(x)))/x. The p-INVERT of s is the sequence t(s) of coefficients in the Maclaurin series for T(x). Taking p(S) = 1 - S gives the "INVERT" transform of s, so that p-INVERT is a generalization of the "INVERT" transform (e.g., A033453).

See A291000 for a guide to related sequences.

Clark Kimberling, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8).

Cf. A000012, A033453, A289780, A291000.

Sequences of the form 1/((1-x)^m - x^m): A000079 (m=1,2), A024495 (m=3), A000749 (m=4), A049016 (m=5), A192080 (m=6), A049017 (m=7), this sequence (m=8), A306939 (m=9).

R:=PowerSeriesRing(Integers(), 60); [0,0,0,0,0,0,0] cat Coefficients(R!( x^7/((1-x)^8 - x^8) )); // G. C. Greubel, Apr 11 2023

z = 60; s = x/(1 - x); p = 1 - s^8;
Drop[CoefficientList[Series[s, {x, 0, z}], x], 1]  (* A000012 *)
Drop[CoefficientList[Series[1/p, {x, 0, z}], x], 1]  (* A290995 *)

concat(vector(7), Vec(x^7 / ((1 - 2*x)*(1 - 2*x + 2*x^2)*(1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4)) + O(x^50))) \\ Colin Barker, Aug 22 2017

def A290995_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( x^7/((1-x)^8 - x^8) ).list()
A290995_list(60) # G. C. Greubel, Apr 11 2023

a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) for n >= 9.
G.f.: x^7 / ((1 - 2*x)*(1 - 2*x + 2*x^2)*(1 - 4*x + 6*x^2 - 4*x^3 + 2*x^4)). - Colin Barker, Aug 22 2017
G.f.: x^7/((1-x)^8 - x^8). - G. C. Greubel, Apr 11 2023

A000750 Expansion of bracket function.

Original entry on oeis.org

1, -5, 15, -35, 70, -125, 200, -275, 275, 0, -1000, 3625, -9500, 21250, -42500, 76875, -124375, 171875, -171875, 0, 621875, -2250000, 5890625, -13171875, 26343750, -47656250, 77109375, -106562500, 106562500, 0

Offset: 0

N. J. A. Sloane

It appears that the (unsigned) sequence is identical to its 5th-order absolute difference. - John W. Layman, Sep 23 2003

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).

Seiichi Manyama, Table of n, a(n) for n = 0..3000
H. W. Gould, Binomial coefficients, the bracket function and compositions with relatively prime summands, Fib. Quart. 2(4) (1964), 241-260.
Index entries for linear recurrences with constant coefficients, signature (-5, -10, -10, -5).

Column 5 of A307047.

Cf. A000748, A000749, A001659, A006090, A049016.

LinearRecurrence[{-5, -10, -10, -5}, {1, -5, 15, -35}, 30] (* Jean-François Alcover, Feb 11 2016 *)

Vec(1/((1+x)^5-x^5) + O(x^40)) \\ Michel Marcus, Feb 11 2016

{a(n) = (-1)^n*sum(k=0, n\5, (-1)^k*binomial(n+4, 5*k+4))} \\ Seiichi Manyama, Mar 21 2019

G.f.: 1/((1+x)^5-x^5).

a(n) = (-1)^n * Sum_{k=0..floor(n/5)} (-1)^k * binomial(n+4,5*k+4). - Seiichi Manyama, Mar 21 2019

A192080 Expansion of 1/((1-x)^6 - x^6).

Original entry on oeis.org

1, 6, 21, 56, 126, 252, 463, 804, 1365, 2366, 4368, 8736, 18565, 40410, 87381, 184604, 379050, 758100, 1486675, 2884776, 5592405, 10919090, 21572460, 43144920, 87087001, 176565486, 357913941, 723002336, 1453179126, 2906358252

Offset: 0

Bruno Berselli, Jun 23 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6).

Cf. A006090, A049016, A049017, A057079, A057083, A057681.

Sequences of the form 1/((1-x)^m - x^m): A000079 (m=1,2), A024495 (m=3), A000749 (m=4), A049016 (m=5), this sequence (m=6), A049017 (m=7), A290995 (m=8), A306939 (m=9).

m:=30; R:=PowerSeriesRing(Integers(),m); Coefficients(R!(1/((1-2*x)*(1-x+x^2)*(1-3*x+3*x^2))));

CoefficientList[Series[1/((1-2*x)*(1-x+x^2)*(1-3*x+3*x^2)), {x,0,50}], x] (* Vincenzo Librandi, Oct 15 2012 *)
LinearRecurrence[{6,-15,20,-15,6},{1,6,21,56,126},30] (* Harvey P. Dale, Feb 22 2017 *)

makelist(coeff(taylor(1/((1-2*x)*(1-x+x^2)*(1-3*x+3*x^2)), x, 0, n), x, n), n, 0, 29);

Vec(1/((1-2*x)*(1-x+x^2)*(1-3*x+3*x^2))+O(x^99)) \\ Charles R Greathouse IV, Jun 23 2011

def A192080_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( 1/((1-x)^6-x^6) ).list()
A192080_list(51) # G. C. Greubel, Apr 11 2023

a(n) = abs(A006090(n)) = (-1)^n * A006090(n).
G.f.: 1/((1-2*x)*(1-x+x^2)*(1-3*x+3*x^2)).
From G. C. Greubel, Apr 11 2023: (Start)
a(n) = (2^(n+5) + A010892(n) - 2*A010892(n-1) - 27*(A057083(n) - 2*A057083(n-1)))/6.
a(n) = (2^(n+5) + A057079(n+2) - 27*A057681(n+1))/6. (End)

cp's OEIS Frontend

A024495 a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

A000749 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A139761 a(n) = Sum_{k >= 0} binomial(n,5*k+4).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

A133476 a(n) = Sum_{k>=0} binomial(n,5*k+1).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A139748 a(n) = Sum_{ k >= 0} binomial(n,5*k+3).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Formula

A000749 a(n) = 4a(n-1) - 6a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.