A073145 -id:A073145 - cp's OEIS frontend

A075092 Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).

6, 0, 2, 12, 6, 20, 50, 56, 134, 264, 402, 836, 1542, 2652, 5154, 9392, 16902, 31824, 58082, 106172, 197126, 360932, 662994, 1223784, 2245766, 4130520, 7606770, 13976436, 25711622, 47310252, 86978370, 160002656, 294324230, 541249952

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Aug 31 2002

Conjecture: a(n) >= 0.

For n > 2, a(n) is the number of cyclic sequences (q1, q2, ..., qn) consisting of zeros, ones and twos such that each triple contains 0 and 1 at least once, provided the positions of the zeros and ones are fixed on a circle. For example, a(5)=20 because only the sequences (00101), (01001), (01010), (01011), (01012), (01021), (01101), (01201), (02101), (20101) and those obtained from them by exchanging 0 and 1 contain 0 and 1 in each triple (including triples q4, q5, q1 and q5, q1, q2). For n = 1, 2 the statement is still true provided we allow the sequence to wrap around itself on a circle. E.g., a(2) = 2 since only sequences 01 and 10 can be wrapped so one obtains (010) and (101), respectively. - Wojciech Florek, Nov 25 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
Wojciech Florek, A class of generalized Tribonacci sequences applied to counting problems, Appl. Math. Comput., 338 (2018), 809-821.
W. O. J. Moser, Cyclic binary strings without long runs of like (alternating) bits, Fibonacci Quart. 31(1) (1993), 2-6.
Index entries for linear recurrences with constant coefficients, signature (0,1,4,1,0,-1).

Cf. A001644, A073145, A075091, A294627.

R:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (6-4*x^2-12*x^3-2*x^4)/(1-x^2-4*x^3-x^4+x^6) ));  // G. C. Greubel, Apr 13 2019

CoefficientList[Series[(6-4*x^2-12*x^3-2*x^4)/(1-x^2-4*x^3-x^4+x^6), {x, 0, 40}], x]

my(x='x+O('x^40)); Vec((6-4*x^2-12*x^3-2*x^4)/(1-x^2-4*x^3-x^4+x^6)) \\ G. C. Greubel, Apr 13 2019

((6-4*x^2-12*x^3-2*x^4)/(1-x^2-4*x^3-x^4+x^6)).series(x, 40).coefficients(x, sparse=False) # G. C. Greubel, Apr 13 2019

a(n) = a(n-2) + 4*a(n-3) + a(n-4) - a(n-6), a(0)=6, a(1)=0, a(2)=2, a(3)=12, a(4)=6, a(5)=20.

G.f.: (6 - 4*x^2 - 12*x^3 - 2*x^4)/(1 - x^2 - 4*x^3 - x^4 + x^6).

A073498 Binomial transform of A073145.

Original entry on oeis.org

3, 4, 4, -2, -24, -76, -164, -248, -160, 520, 2544, 6736, 12720, 15552, -640, -70432, -246784, -565824, -923456, -792448, 1239296, 7864960, 22439168, 45045504, 61276928, 19713024, -198718464, -790598144, -1930655744, -3376471040, -3503145984, 2384930816, 23805657088

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Aug 03 2002

N. J. A. Sloane, Transforms
Index entries for linear recurrences with constant coefficients, signature (4, -6, 2).

Cf. A073145.

CoefficientList[Series[(3-8*x+6*x^2)/(1-4*x+6*x^2-2*x^3), {x, 0, 50}], x]

O.g.f.: (3-8x+6x^2)/(1-4x+6x^2-2x^3); a(n)=4a(n-1)-6a(n-2)+2a(n-3), a(0)=3, a(1)=4, a(2)=4

A073702 a(n) = A073145(n)^2.

Original entry on oeis.org

9, 1, 1, 25, 25, 1, 121, 225, 9, 529, 1681, 441, 1849, 11025, 6889, 4225, 64009, 73441, 2209, 326041, 632025, 31329, 1413721, 4669921, 1320201, 4844401, 30371121, 19882681, 10582009, 174847729, 208196041, 4190209, 882030601, 1770810561

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Aug 04 2002

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

Cf. A001644, A073145, A073496.

R:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (9+x+ 10*x^2-28*x^3-7*x^4-x^5)/(1+x^2-6*x^3-3*x^4-2*x^5+x^6) )); // G. C. Greubel, Apr 23 2019

CoefficientList[Series[(9+x+10x^2-28x^3-7x^4-x^5)/(1+x^2-6x^3-3x^4-2x^5 +x^6), {x, 0, 40}], x]
LinearRecurrence[{0,-1,6,3,2,-1},{9,1,1,25,25,1},40] (* Harvey P. Dale, Feb 14 2015 *)

my(x='x+O('x^40)); Vec((9+x+10*x^2-28*x^3-7*x^4-x^5)/(1+x^2-6*x^3 -3*x^4-2*x^5+x^6)) \\ G. C. Greubel, Apr 23 2019

((9+x+10*x^2-28*x^3-7*x^4-x^5)/(1+x^2-6*x^3-3*x^4-2*x^5+x^6) ).series(x, 40).coefficients(x, sparse=False) # G. C. Greubel, Apr 23 2019

a(n) = -a(n-2) + 6*a(n-3) + 3*a(n-4) + 2*a(n-5) - a(n-6) with a(0)=9, a(1)=1, a(2)=1, a(3)=25, a(4)=25, a(5)=1.
G.f.: (9+x+10*x^2-28*x^3-7*x^4-x^5)/(1+x^2-6*x^3-3*x^4-2*x^5+x^6).
a(n) = 2*A001644(n) + A073496(n).

A074585 a(n)= Sum_{j=0..floor(n/2)} A073145(2j + q), where q = 2(n/2 - floor(n/2)).

Original entry on oeis.org

3, -1, 2, 4, -3, 3, 8, -12, 11, 11, -30, 32, 13, -73, 96, -8, -157, 263, -110, -308, 685, -485, -504, 1676, -1653, -525, 3858, -4984, 605, 8239, -13824, 6192, 15875, -35889, 26210, 25556, -87651, 88307, 24904, -200860, 264267, -38501, -426622

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Aug 28 2002

a(n) is the convolution of A073145(n) with the sequence (1,0,1,0,1,0, ...).

a(n) is also the sum of the reflected (see A074058) sequence of the generalized tribonacci sequence (A001644).

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (-1,0,2,1,-1).

Cf. A073145, A074058, A001644, A074331, A074392, A074475.

R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (3+2*x+x^2)/(1+x-2*x^3-x^4+x^5) )); // G. C. Greubel, Apr 13 2019

CoefficientList[ Series[(3+2*x+x^2)/(1+x-2*x^3-x^4+x^5), {x, 0, 50}], x]

my(x='x+O('x^50)); Vec((3+2*x+x^2)/(1+x-2*x^3-x^4+x^5)) \\ G. C. Greubel, Apr 13 2019

((3+2*x+x^2)/(1+x-2*x^3-x^4+x^5)).series(x, 50).coefficients(x, sparse=False) # G. C. Greubel, Apr 13 2019

a(n) = -a(n-1) + 2*a(n-3) + a(n-4) - a(n-5), a(0) = 3, a(1) = -1, a(2) = 2, a(3) = 4, a(4) = -3.

G.f.: (3 + 2*x + x^2)/(1 + x - 2*x^3 - x^4 + x^5).

More terms from Robert G. Wilson v, Aug 29 2002

A075419 Convolution of A073145 with A056594.

Original entry on oeis.org

3, -1, -4, 6, -1, -7, 12, -8, -9, 31, -32, -10, 75, -95, 8, 160, -261, 111, 308, -682, 487, 505, -1676, 1656, 527, -3857, 4984, -602, -8237, 13825, -6192, -15872, 35891, -26209, -25556, 87654, -88305, -24903, 200860, -264264, 38503, 426623, -729392, 341270, 814747, -1885407, 1411928, 1288224

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Sep 17 2002

Index entries for linear recurrences with constant coefficients, signature (-1,-2,0,-1,1).

Cf. A073145, A075495.

CoefficientList[Series[(3 + 2x + x^2)/(1 + x + 2x^2 + x^4 - x^5), {x, 0, 50}], x]
LinearRecurrence[{-1,-2,0,-1,1},{3,-1,-4,6,-1},50] (* Harvey P. Dale, Jul 27 2019 *)

a(n) = -a(n-1) - 2*a(n-2) - a(n-4) + a(n-5); a(0)=3, a(1)=-1, a(2)=-4, a(3)=6, a(4)=-1.

G.f.: (3 + 2*x + x^2)/(1 + x + 2*x^2 + x^4 - x^5).

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

Original entry on oeis.org

3, 1, 3, 7, 11, 21, 39, 71, 131, 241, 443, 815, 1499, 2757, 5071, 9327, 17155, 31553, 58035, 106743, 196331, 361109, 664183, 1221623, 2246915, 4132721, 7601259, 13980895, 25714875, 47297029, 86992799, 160004703, 294294531, 541292033, 995591267, 1831177831

Offset: 0

N. J. A. Sloane

For n >= 3, a(n) is the number of cyclic sequences consisting of n zeros and ones that do not contain three consecutive ones provided the positions of the zeros and ones are fixed on a circle. This is proved in Charalambides (1991) and Zhang and Hadjicostas (2015). For example, a(3)=7 because only the sequences 110, 101, 011, 001, 010, 100 and 000 avoid three consecutive ones. (For n=1,2 the statement is still true provided we allow the sequence to wrap around itself on a circle.) - Petros Hadjicostas, Dec 16 2016
For n >= 3, also the number of dominating sets on the n-cycle graph C_n. - Eric W. Weisstein, Mar 30 2017
For n >= 3, also the number of minimal dominating sets and maximal irredundant sets on the n-sun graph. - Eric W. Weisstein, Jul 28 and Aug 17 2017
For n >= 3, also the number of minimal edge covers in the n-web graph. - Eric W. Weisstein, Aug 03 2017
For n >= 1, also the number of ways to tile a bracelet of length n with squares, dominoes, and trominoes. - Ruijia Li and Greg Dresden, Sep 14 2019
If n is prime, then a(n)-1 is a multiple of n ; a counterexample for the converse is given by n = 182. - Robert FERREOL, Apr 03 2024

			G.f. = 3 + x + 3*x^2 + 7*x^3 + 11*x^4 + 21*x^5 + 39*x^6 + 71*x^7 + 131*x^8 + ...

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 500.
G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.
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).

G. C. Greubel, Table of n, a(n) for n = 0..1000 (terms 1..200 from T. D. Noe)
Kunle Adegoke, Robert Frontczak, and Taras Goy, Binomial Tribonacci Sums, Disc. Math. Lett. (2022) Vol. 8, 30-37.
Kunle Adegoke, Adenike Olatinwo, and Winning Oyekanmi, New Tribonacci Recurrence Relations and Addition Formulas, arXiv:1811.03663 [math.CO], 2018.
Daniel Birmajer, Juan B. Gil, and Michael D. Weiner, Linear recurrence sequences with indices in arithmetic progression and their sums, arXiv:1505.06339 [math.NT], 2015.
Martin Burtscher, Igor Szczyrba, and Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
C. A. Charalambides, Lucas numbers and polynomials of order k and the length of the longest circular success run, The Fibonacci Quarterly, 29 (1991), 290-297.
Curtis Cooper, Steven Miller, Peter J. C. Moses, Murat Sahin, and Thotsaporn Thanatipanonda, On Identities Of Ruggles, Horadam, Howard, and Young, Preprint, 2016.
Curtis Cooper, Steven Miller, Peter J. C. Moses, Murat Sahin, and Thotsaporn Thanatipanonda, On identities of Ruggles, Hradam, Howard, and Young, The Fibonacci Quarterly, 55.5 (2017), 42-65.
M. Elia, Derived Sequences, The Tribonacci Recurrence and Cubic Forms, The Fibonacci Quarterly, 39.2 (2001), 107-109.
G. Everest, A. J. van der Poorten, Y. Puri and T. Ward, Integer Sequences and Periodic Points, Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.3.
G. Everest, Y. Puri and T. Ward, Integer sequences counting periodic points, arXiv:math/0204173 [math.NT], 2002.
Daniel C. Fielder, Special integer sequences controlled by three parameters, Fibonacci Quarterly 6, 1968, 64-70.
Robert Frontczak, Sums of Tribonacci and Tribonacci-Lucas Numbers, International Journal of Mathematical Analysis, Vol. 12 (2018), No. 1, pp. 19-24.
Robert Frontczak, Convolutions for Generalized Tribonacci Numbers and Related Results, International Journal of Mathematical Analysis (2018) Vol. 12, Issue 7, 307-324.
Petros Hadjicostas, Cyclic Compositions of a Positive Integer with Parts Avoiding an Arithmetic Sequence, Journal of Integer Sequences, 19 (2016), #16.8.2.
A. Ilic, S. Klavzar, and Y. Rho, Generalized Lucas Cubes, Appl. An. Disc. Math. 6 (2012) 82-94, proposition 11 for the sequence starting 1, 2, 4, 7, 11,...
Günter Köhler, Generating functions of Fibonacci-like sequences and decimal expansion of some fractions, The Fibonacci Quarterly 23, no.1, (1985), 29-35 [a(n) is there Lambda_n on p. 35].
Pin-Yen Lin, De Moivre type identities for the Tribonacci numbers, The Fibonacci Quarterly 26, no.2, (1988), 131-134.
Matthew Macauley, Jon McCammond, and Henning S. Mortveit, Dynamics groups of asynchronous cellular automata, Journal of Algebraic Combinatorics, Vol 33, No 1 (2011), pp. 11-35.
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
Yassine Otmani, The 2-Pascal Triangle and a Related Riordan Array, J. Int. Seq. (2025) Vol. 28, Issue 3, Art. No. 25.3.5. See p. 21.
J. Pan, Some Properties of the Multiple Binomial Transform and the Hankel Transform of Shifted Sequences, J. Int. Seq. 14 (2011) # 11.3.4, remark 17.
Andreas N. Philippou and Spiros D. Dafnis, A simple proof of an identity generalizing Fibonacci-Lucas identities, Fibonacci Quarterly (2018) Vol. 56, No. 4, 334-336.
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
J. L. Ramírez and V. F. Sirvent, A Generalization of the k-Bonacci Sequence from Riordan Arrays, The Electronic Journal of Combinatorics, 22(1) (2015), #P1.38.
Souvik Roy, Nazim Fatès, and Sukanta Das, Reversibility of Elementary Cellular Automata with fully asynchronous updating: an analysis of the rules with partial recurrence, hal-04456320 [nlin.CG], [cs], 2024. See p. 17.
S. Saito, T. Tanaka, and N. Wakabayashi, Combinatorial Remarks on the Cyclic Sum Formula for Multiple Zeta Values, J. Int. Seq. 14 (2011) # 11.2.4, Table 3.
Eric Weisstein's World of Mathematics, Cycle Graph
Eric Weisstein's World of Mathematics, Dominating Set
Eric Weisstein's World of Mathematics, Lucas n-Step Number
Eric Weisstein's World of Mathematics, Maximal Irredundant Set
Eric Weisstein's World of Mathematics, Minimal Edge Cover
Eric Weisstein's World of Mathematics, Sun Graph
Eric Weisstein's World of Mathematics, Tribonacci Number
Eric Weisstein's World of Mathematics, Web Graph
Wikipedia, Companion matrix.
A. V. Zarelua, On Matrix Analogs of Fermat's Little Theorem, Mathematical Notes, vol. 79, no. 6, 2006, pp. 783-796. Translated from Matematicheskie Zametki, vol. 79, no. 6, 2006, pp. 840-855.
L. Zhang and P. Hadjicostas, On sequences of independent Bernoulli trials avoiding the pattern '11..1', Math. Scientist, 40 (2015), 89-96.
Index entries for linear recurrences with constant coefficients, signature (1,1,1).

Cf. A000073, A073145, A106293 (Pisano periods), A073728 (partial sums).
Cf. A058265.
Cf. A001609, A001634 - A001636, A001638 - A001645, A001648, A001649.

a:=[3,1,3];; for n in [4..40] do a[n]:=a[n-1]+a[n-2]+a[n-3]; od; a; # Muniru A Asiru, Dec 18 2018

a001644 n = a001644_list !! n
a001644_list = 3 : 1 : 3 : zipWith3 (((+) .) . (+))
               a001644_list (tail a001644_list) (drop 2 a001644_list)
-- Reinhard Zumkeller, Apr 13 2014

I:=[3,1,3]; [n le 3 select I[n] else Self(n-1)+Self(n-2)+ Self(n-3): n in [1..40]]; // Vincenzo Librandi, Aug 04 2017

A001644:=-(1+2*z+3*z**2)/(z**3+z**2+z-1); # Simon Plouffe in his 1992 dissertation; gives sequence except for the initial 3
A001644 :=proc(n)
    option remember;
    if n <= 2 then
        1+2*modp(n+1,2)
    else
        procname(n-1)+procname(n-2)+procname(n-3);
    end if;
end proc:
seq(A001644(n),n=0..80) ;

a[x_]:= a[x] = a[x-1] +a[x-2] +a[x-3]; a[0] = 3; a[1] = 1; a[2] = 3; Array[a, 40, 0]
a[n_]:= n*Sum[Sum[Binomial[j, n-3*k+2*j]*Binomial[k, j], {j,n-3*k,k}]/k, {k, n}]; a[0] = 3; Array[a, 40, 0] (* Robert G. Wilson v, Feb 24 2011 *)
LinearRecurrence[{1, 1, 1}, {3, 1, 3}, 40] (* Vladimir Joseph Stephan Orlovsky, Feb 08 2012 *)
Table[RootSum[-1 - # - #^2 + #^3 &, #^n &], {n, 0, 40}] (* Eric W. Weisstein, Mar 30 2017 *)
RootSum[-1 - # - #^2 + #^3 &, #^Range[0, 40] &] (* Eric W. Weisstein, Aug 17 2017 *)

{a(n) = if( n<0, polsym(1 - x - x^2 - x^3, -n)[-n+1], polsym(1 + x + x^2 - x^3, n)[n+1])}; /* Michael Somos, Nov 02 2002 */

my(x='x+O('x^40)); Vec((3-2*x-x^2)/(1-x-x^2-x^3)) \\ Altug Alkan, Apr 19 2018

((3-2*x-x^2)/(1-x-x^2-x^3)).series(x, 40).coefficients(x, sparse=False) # G. C. Greubel, Mar 22 2019

Binet's formula: a(n) = r1^n + r2^n + r3^n, where r1, r2, r3 are the roots of the characteristic polynomial 1 + x + x^2 - x^3, see A058265.
a(n) = A000073(n) + 2*A000073(n-1) + 3*A000073(n-2).
G.f.: (3-2*x-x^2)/(1-x-x^2-x^3). - Miklos Kristof, Jul 29 2002
a(n) = n*Sum_{k=1..n} Sum_{j=n-3*k..k} binomial(j, n-3*k+2*j)*binomial(k,j)/k, n > 0, a(0)=3. - Vladimir Kruchinin, Feb 24 2011
a(n) = a(n-1) + a(n-2) + a(n-3), a(0)=3, a(1)=1, a(2)=3. - Harvey P. Dale, Feb 01 2015
a(n) = A073145(-n). for all n in Z. - Michael Somos, Dec 17 2016
Sum_{k=0..n} k*a(k) = (n*a(n+3) - a(n+2) - (n+1)*a(n+1) + 4)/2. - Yichen Wang, Aug 30 2020
a(n) = Trace(M^n), where M = [0, 0, 1; 1, 0, 1; 0, 1, 1] is the companion matrix to the monic polynomial x^3 - x^2 - x - 1. It follows that the sequence satisfies the Gauss congruences: a(n*p^r) == a(n*p^(r-1)) (mod p^r) for positive integers n and r and all primes p. See Zarelua. - Peter Bala, Dec 29 2022

Edited by Mario Catalani (mario.catalani(AT)unito.it), Jul 17 2002

Deleted certain dangerous or potentially dangerous links. - N. J. A. Sloane, Jan 30 2021

A075298 Inverted (definition in A075193) generalized tribonacci numbers A001644.

Original entry on oeis.org

1, 1, -5, 5, 1, -11, 15, -3, -23, 41, -21, -43, 105, -83, -65, 253, -271, -47, 571, -795, 177, 1189, -2161, 1149, 2201, -5511, 4459, 3253, -13223, 14429, 2047, -29699, 42081, -10335, -61445, 113861, -62751, -112555, 289167, -239363, -162359, 690889, -767893, -85355, 1544137, -2226675, 597183, 3173629

Offset: 0

Mario Catalani (mario.catalani(AT)unito.it), Sep 13 2002

a(n) = -C(n+1), C(n)=reflected generalized tribonacci numbers A073145.

G. C. Greubel, Table of n, a(n) for n = 0..5000
Curtis Cooper, S. Miller, Peter J. C. Moses, M. Sahin, and T. Thanatipanonda, On Identities of Ruggles, Horadam, Howard, and Young, Preprint 2016.
Index entries for linear recurrences with constant coefficients, signature (-1,-1,1).

Cf. A001644, A073145, A075193.

a:=[1,1,-5];; for n in [4..50] do a[n]:=-a[n-1]-a[n-2]+a[n-3]; od; a; # G. C. Greubel, Apr 09 2019

R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (1+2*x-3*x^2)/(1+x+x^2-x^3) )); // G. C. Greubel, Apr 09 2019

CoefficientList[Series[(1+2x-3x^2)/(1+x+x^2-x^3), {x, 0, 50}], x]

my(x='x+O('x^50)); Vec((1+2*x-3*x^2)/(1+x+x^2-x^3)) \\ G. C. Greubel, Apr 09 2019

((1+2*x-3*x^2)/(1+x+x^2-x^3)).series(x, 50).coefficients(x, sparse=False) # G. C. Greubel, Apr 09 2019

a(n) = -a(n-1) - a(n-2) + a(n-3), a(0)=1, a(1)=1, a(2)=-5.
G.f.: (1+2*x-3*x^2)/(1+x+x^2-x^3).
a(n) = A078046(n) + 3*A078046(n-1). - R. J. Mathar, Sep 20 2020

cp's OEIS Frontend

A075115 Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A075092 Sum of generalized tribonacci numbers (A001644) and reflected generalized tribonacci numbers (A073145).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A073498 Binomial transform of A073145.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A073702 a(n) = A073145(n)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A074585 a(n)= Sum_{j=0..floor(n/2)} A073145(2*j + q), where q = 2*(n/2 - floor(n/2)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A075419 Convolution of A073145 with A056594.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

A074585 a(n)= Sum_{j=0..floor(n/2)} A073145(2j + q), where q = 2(n/2 - floor(n/2)).