A000322 -id:A000322 - cp's OEIS frontend

A127193 A 9th-order Fibonacci sequence.

1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 17, 33, 65, 129, 257, 513, 1025, 2049, 4097, 8185, 16353, 32673, 65281, 130433, 260609, 520705, 1040385, 2078721, 4153345, 8298505, 16580657, 33128641, 66192001, 132253569, 264246529, 527972353, 1054904321

Offset: 1

Luis A Restrepo (luisiii(AT)mac.com), Jan 07 2007

9-Bonacci constant = 1.99802947...

Robert Price, Table of n, a(n) for n = 1..1000
E. S. Croot, Notes on Linear Recurrence Sequences
M. A. Lerma, Recurrence Relations
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1,1,1).

Cf. Fibonacci numbers A000045, tribonacci numbers A000213, tetranacci numbers A000288, pentanacci numbers A000322, hexanacci numbers A000383, 7th-order Fibonacci numbers A060455, octanacci numbers, A123526.

LinearRecurrence[{1,1,1,1,1,1,1,1,1},{1,1,1,1,1,1,1,1,1},40] (* Ray Chandler, Aug 01 2015 *)
With[{c=Table[1,{9}]},LinearRecurrence[c,c,40]] (* Harvey P. Dale, Apr 08 2016 *)

x='x+O('x^50); Vec((x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9+7*x^10)/(1 -2*x+ x^10)) \\ G. C. Greubel, Jul 28 2017

For a(1)=...=a(9)=1, a(10)=9, a(n)= 2*a(n-1) - a(n-10). - Vincenzo Librandi, Dec 20 2010

G.f.: x*(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8+7*x^9)/(1-2*x+x^10). - G. C. Greubel, Jul 28 2017

A122189 Heptanacci numbers: each term is the sum of the preceding 7 terms, with a(0),...,a(6) = 0,0,0,0,0,0,1.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 127, 253, 504, 1004, 2000, 3984, 7936, 15808, 31489, 62725, 124946, 248888, 495776, 987568, 1967200, 3918592, 7805695, 15548665, 30972384, 61695880, 122895984, 244804400, 487641600, 971364608, 1934923521

Offset: 0

Roger L. Bagula and Gary W. Adamson, Oct 18 2006

See A066178 (essentially the same sequence) for more about the heptanacci numbers and other generalizations of the Fibonacci numbers (A000045).

Robert Price, Table of n, a(n) for n = 0..1000
Tomás Aguilar-Fraga, Jennifer Elder, Rebecca E. Garcia, Kimberly P. Hadaway, Pamela E. Harris, Kimberly J. Harry, Imhotep B. Hogan, Jakeyl Johnson, Jan Kretschmann, Kobe Lawson-Chavanu, J. Carlos Martínez Mori, Casandra D. Monroe, Daniel Quiñonez, Dirk Tolson III, and Dwight Anderson Williams II, Interval and L-interval Rational Parking Functions, arXiv:2311.14055 [math.CO], 2023. See p. 14.
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.
Taras Goy and Mark Shattuck, Some Toeplitz-Hessenberg Determinant Identities for the Tetranacci Numbers, J. Int. Seq., Vol. 23 (2020), Article 20.6.8.
Tian-Xiao He, Impulse Response Sequences and Construction of Number Sequence Identities, J. Int. Seq. 16 (2013) #13.8.2.
F. T. Howard and Curtis Cooper, Some identities for r-Fibonacci numbers, Fibonacci Quart. 49 (2011), no. 3, 231-243.
Omar Khadir, László Németh, and László Szalay, Tiling of dominoes with ranked colors, Results in Math. (2024) Vol. 79, Art. No. 253. See p. 2.
Benjamin E. Merkel, Probabilities of Consecutive Events in Coin Flipping, Master's Thesis, Univ. Cincinatti, May 11 2011.
László Németh and László Szalay, Explicit solution of system of two higher-order recurrences, arXiv:2408.12196 [math.NT], 2024. See p. 10.
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1).

Cf. A000045 (k=2, Fibonacci numbers), A000073 (k=3, tribonacci) A000078 (k=4, tetranacci) A001591 (k=5, pentanacci) A001592 (k=6, hexanacci), A122189 (k=7, heptanacci).

Cf. A066178, A000322, A248700.

for n from 0 to 50 do k(n):=sum((-1)^i*binomial(n-6-7*i,i)*2^(n-6-8*i),i=0..floor((n-6)/8))-sum((-1)^i*binomial(n-7-7*i,i)*2^(n-7-8*i),i=0..floor((n-7)/8)):od:seq(k(n),n=0..50); a:=taylor((z^6-z^7)/(1-2*z+z^8),z=0,51);for p from 0 to 50 do j(p):=coeff(a,z,p):od :seq(j(p),p=0..50); # Richard Choulet, Feb 22 2010

LinearRecurrence[{1, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 0, 0, 1}, 50] (* Vladimir Joseph Stephan Orlovsky, May 25 2011 *)
a={0,0,0,0,0,0,1} For[n=7, n≤100, n++, sum=Plus@@a; Print[sum]; a=RotateLeft[a]; a[[7]]=sum] (* Robert Price, Dec 04 2014 *)

a(n)=([0,1,0,0,0,0,0; 0,0,1,0,0,0,0; 0,0,0,1,0,0,0; 0,0,0,0,1,0,0; 0,0,0,0,0,1,0; 0,0,0,0,0,0,1; 1,1,1,1,1,1,1]^n*[0;0;0;0;0;0;1])[1,1] \\ Charles R Greathouse IV, Jun 20 2015

G.f.: x^6/(1-x-x^2-x^3-x^4-x^5-x^6-x^7). - R. J. Mathar, Feb 13 2009
G.f.: Sum_{n >= 0} x^(n+5) * [ Product_{k = 1..n} (k + k*x + k*x^2 + k*x^3 + k*x^4 + k*x^5 + x^6)/(1 + k*x + k*x^2 + k*x^3 + k*x^4 + k*x^5 + k*x^6) ]. - Peter Bala, Jan 04 2015
Another form of the g.f.: f(z) = (z^6-z^7)/(1-2*z+z^8), then a(n) = Sum_{i=0..floor((n-6)/8)} (-1)^i*binomial(n-6-7*i,i)*2^(n-6-8*i) - Sum_{i=0..floor((n-7)/8)} (-1)^i*binomial(n-7-7*i,i)*2^(n-7-8*i) with Sum_{i=m..n} alpha(i) = 0 for m>n. - Richard Choulet, Feb 22 2010
Sum_{k=0..6*n} a(k+b)*A063265(n,k) = a(7*n+b), b>=0.
a(n) = 2*a(n-1) - a(n-8). - Joerg Arndt, Sep 24 2020

Edited by N. J. A. Sloane, Nov 20 2007

Wrong Binet-type formula removed by R. J. Mathar, Feb 13 2009

A214827 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 5.

Original entry on oeis.org

1, 5, 5, 11, 21, 37, 69, 127, 233, 429, 789, 1451, 2669, 4909, 9029, 16607, 30545, 56181, 103333, 190059, 349573, 642965, 1182597, 2175135, 4000697, 7358429, 13534261, 24893387, 45786077, 84213725, 154893189, 284892991, 523999905

Offset: 0

Abel Amene, Jul 29 2012

See comments in A214727.

Robert Price, Table of n, a(n) for n = 0..1000
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Index entries for linear recurrences with constant coefficients, signature (1,1,1).

Cf. A000213, A000288, A000322, A000383, A060455, A136175, A141036, A141523, A214825-A214831.

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

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

LinearRecurrence[{1,1,1},{1,5,5},40] (* Ray Chandler, Dec 08 2013 *)

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

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

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

a(n) = -A000073(n) + 4*A000073(n+1) + A000073(n+2). - R. J. Mathar, Jul 29 2012

A214831 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 9.

Original entry on oeis.org

1, 9, 9, 19, 37, 65, 121, 223, 409, 753, 1385, 2547, 4685, 8617, 15849, 29151, 53617, 98617, 181385, 333619, 613621, 1128625, 2075865, 3818111, 7022601, 12916577, 23757289, 43696467, 80370333, 147824089, 271890889, 500085311, 919800289, 1691776489

Offset: 0

Abel Amene, Aug 07 2012

Part of a group of sequences defined by a(0), a(1)=a(2), a(n)=a(n-1)+a(n-2)+a(n-3) which is a subgroup of sequences with linear recurrences and constant coefficients listed in the index. See comments in A214727.

Robert Price, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,1).

Cf. A000213, A000288, A000322, A000383, A060455, A136175, A141036, A141523, A214825-A214831, A244930, A244931.

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

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

LinearRecurrence[{1,1,1},{1,9,9},40] (* Harvey P. Dale, Oct 11 2017 *)

Vec((x^2-8*x-1)/(x^3+x^2+x-1) + O(x^40)) \\ Michel Marcus, Jul 08 2014

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

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

a(n) = -A000073(n) + 8*A000073(n+1) + A000073(n+2). - G. C. Greubel, Apr 24 2019

A001949 Solutions of a fifth-order probability difference equation.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 2, 4, 8, 16, 32, 63, 124, 244, 480, 944, 1856, 3649, 7174, 14104, 27728, 54512, 107168, 210687, 414200, 814296, 1600864, 3147216, 6187264, 12163841, 23913482, 47012668, 92424472, 181701728, 357216192, 702268543, 1380623604, 2714234540

Offset: 0

N. J. A. Sloane

This sequence is the case r = 5 in the solution to an r-th order probability difference equation that can be found in Eqs. (4) and (3) on p. 356 of Dunkel (1925). (Equation (3) follows equation (4) in the paper!) For r = 2, we get a shifted version of A000071. For r = 3, we get a shifted version of A008937. For r = 4, we get a shifted version of A107066. For r = 6, we get a shifted version of A172316. See also the table in A172119. - Petros Hadjicostas, Jun 15 2019

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

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
O. Dunkel, Solutions of a probability difference equation, Amer. Math. Monthly, 32 (1925), 354-370; see pp. 356 and 369.
T. Langley, J. Liese, and J. Remmel, Generating Functions for Wilf Equivalence Under Generalized Factor Order, J. Int. Seq. 14 (2011), Article #11.4.2.
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
Index entries for linear recurrences with constant coefficients, signature (2,0,0,0,0,-1)

Column k = 1 of A141020 (with a different offset) and second main diagonal of A141021 (with no zeros).
Column k = 5 of A172119.
Partial sums of A001591.

A001949:=1/(z-1)/(z**5+z**4+z**3+z**2+z-1); # Simon Plouffe in his 1992 dissertation

t={0,0,0,0,0};Do[AppendTo[t,t[[-5]]+t[[-4]]+t[[-3]]+t[[-2]]+t[[-1]]+1],{n,40}];t (* Vladimir Joseph Stephan Orlovsky, Jan 21 2012 *)
LinearRecurrence[{2,0,0,0,0,-1},{0,0,0,0,0,1},40] (* Harvey P. Dale, Jan 17 2015 *)

a(n):=sum(sum((-1)^j*binomial(n-5*j-5,k-1)*binomial(n-k-5*j-4,j),j,0,(n-k-4)/5),k,1,n-4); /* Vladimir Kruchinin, Oct 19 2011 */

x='x+O('x^99); concat(vector(5), Vec(x^5/((x-1)*(x^5+x^4+x^3+x^2+x-1)))) \\ Altug Alkan, Oct 04 2017

For n >= 6, a(n+1) = 2*a(n) - a(n-5).
G.f.: x^5 / ( (x-1)*(x^5 + x^4 + x^3 + x^2 + x - 1) ).
a(n) = Sum_{k=1..n-4} Sum_{j=0..floor((n-k-4)/5)} (-1)^j*binomial(n-5*j-5, k-1)*binomial(n-k-5*j-4, j). - Vladimir Kruchinin, Oct 19 2011
4*a(n) = A000322(n+1) - 1. - R. J. Mathar, Aug 16 2017
From Petros Hadjicostas, Jun 15 2019: (Start)
a(n) = 1 + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) for n >= 5. (See Eq. (4) and the Theorem with r = 5 on p. 356 of Dunkel (1925).)
a(n) = T(n - 5, 5) for n >= 5, where T(n, k) = Sum_{j = 0..floor(n/(k+1))} (-1)^j * binomial(n - k*j, n - (k+1)*j) * 2^(n - (k+1)*j) for 0 <= k <= n. This is Richard Choulet's formula in A172119.
(End)

Name edited by Petros Hadjicostas, Jun 15 2019

A249413 Primes in the hexanacci numbers sequence A000383.

Original entry on oeis.org

11, 41, 72426721, 143664401, 565262081, 4160105226881, 253399862985121, 997027328131841, 212479323351825962211841, 188939838859312612896128881921, 22828424707602602744356458636161, 661045104283639247572028952777478721

Offset: 1

Robert Price, Dec 03 2014

nonn

a(13) is too large to display here. It has 62 digits and is the 210th term in A000383.

Cf. A001590, A001631, A100683, A231574, A231575, A232543, A214899, A020992, A233554, A214727, A234696, A141523, A235862, A214825, A235873, A001630, A241660, A247027, A000288, A247561, A000322, A248920, A000383, A247192.

a={1,1,1,1,1,1}; For[n=6, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[5]]=sum]

A214828 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 6.

Original entry on oeis.org

1, 6, 6, 13, 25, 44, 82, 151, 277, 510, 938, 1725, 3173, 5836, 10734, 19743, 36313, 66790, 122846, 225949, 415585, 764380, 1405914, 2585879, 4756173, 8747966, 16090018, 29594157, 54432141, 100116316, 184142614, 338691071, 622950001

Offset: 0

Abel Amene, Jul 30 2012

See comments in A214727.

Robert Price, Table of n, a(n) for n = 0..1000
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.
Index entries for linear recurrences with constant coefficients, signature (1,1,1).

Cf. A000213, A000288, A000322, A000383, A060455, A136175, A141036, A141523, A214825-A214831.

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

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

LinearRecurrence[{1,1,1},{1,6,6},33] (* Ray Chandler, Dec 08 2013 *)

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

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

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

a(n) = -A000073(n) + 5*A000073(n+1) + A000073(n+2). - G. C. Greubel, Apr 24 2019

A123526 Octanacci numbers.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 8, 15, 29, 57, 113, 225, 449, 897, 1793, 3578, 7141, 14253, 28449, 56785, 113345, 226241, 451585, 901377, 1799176, 3591211, 7168169, 14307889, 28558993, 57004641, 113783041, 227114497, 453327617, 904856058, 1806120905

Offset: 1

Danny Rorabaugh, Nov 10 2006

Robert Price, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1,1).

Cf. A000045, A000213, A000288, A000322, A000383, A060455, A079262.

Cf. A254412, A254413. Indices of primes and primes in this sequence.

R:=PowerSeriesRing(Integers(), 50);
Coefficients(R!( x*(1-x^2-2*x^3-3*x^4-4*x^5-5*x^6-6*x^7)/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8) )); // G. C. Greubel, Mar 10 2021

m:=50; S:=series( x*(1-x^2-2*x^3-3*x^4-4*x^5-5*x^6-6*x^7)/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8), x, m+1):
seq(coeff(S, x, j), j=1..m); # G. C. Greubel, Mar 10 2021

Module[{nn=8,lr},lr=PadRight[{},nn,1];LinearRecurrence[lr,lr,20]] (* Harvey P. Dale, Feb 04 2015 *)

Vec(x*(1-x^2-2*x^3-3*x^4-4*x^5-5*x^6-6*x^7)/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8) + O(x^50)) \\ Colin Barker, Oct 19 2015

@CachedFunction
def A123526(n):
    if (n<9): return 1
    else: return sum(A(n-j) for j in (1..8))
[A123526(n) for n in [1..50]] # G. C. Greubel, Mar 10 2021

a(n)=1 for 1 <= n <= 8, a(n) = a(n-1) + a(n-2) +...+ a(n-8) for n > 8.

G.f.: x*(1 -x^2 -2*x^3 -3*x^4 -4*x^5 -5*x^6 -6*x^7)/(1 -x -x^2 -x^3 -x^4 -x^5 -x^6 -x^7 -x^8). - Colin Barker, Oct 19 2015

A214829 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 7.

Original entry on oeis.org

1, 7, 7, 15, 29, 51, 95, 175, 321, 591, 1087, 1999, 3677, 6763, 12439, 22879, 42081, 77399, 142359, 261839, 481597, 885795, 1629231, 2996623, 5511649, 10137503, 18645775, 34294927, 63078205, 116018907, 213392039, 392489151, 721900097, 1327781287, 2442170535

Offset: 0

Abel Amene, Aug 07 2012

See comments in A214727.

Robert Price, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,1).

Cf. A000213, A000288, A000322, A000383, A060455, A136175, A141036, A141523, A214825, A214826, A214827, A214828, A214830, A214831.

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

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

LinearRecurrence[{1,1,1}, {1,7,7}, 40] (* G. C. Greubel, Apr 24 2019 *)

Vec((x^2-6*x-1)/(x^3+x^2+x-1) + O(x^40)) \\ Michel Marcus, Jun 04 2017

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

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

a(n) = -A000073(n) + 6*A000073(n+1) + A000073(n+2). - G. C. Greubel, Apr 24 2019

A127194 A 10th-order Fibonacci sequence.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 19, 37, 73, 145, 289, 577, 1153, 2305, 4609, 9217, 18424, 36829, 73621, 147169, 294193, 588097, 1175617, 2350081, 4697857, 9391105, 18772993, 37527562, 75018295, 149962969, 299778769, 599263345, 1197938593

Offset: 1

Luis A Restrepo (luisiii(AT)hotmail.com), Jan 11 2007

10th-order Fibonacci constant = 1.999018633...

Robert Price, Table of n, a(n) for n = 1..1000
E. S. Croot, Notes on Linear Recurrence Sequences
M. A. Lerma, Recurrence Relations
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1,1,1,1).

Cf. Fibonacci numbers A000045, tribonacci numbers A000213, tetranacci numbers A000288, pentanacci numbers A000322, hexanacci numbers A000383, heptanacci numbers A060455, octanacci numbers A123526, 9th-order Fibonacci sequence A127193.

Cf. A257073, A257074.

With[{t=Table[1,{10}]},LinearRecurrence[t,t,40]] (* Harvey P. Dale, Nov 12 2013 *)

a(n)=([0,1,0,0,0,0,0,0,0,0; 0,0,1,0,0,0,0,0,0,0; 0,0,0,1,0,0,0,0,0,0; 0,0,0,0,1,0,0,0,0,0; 0,0,0,0,0,1,0,0,0,0; 0,0,0,0,0,0,1,0,0,0; 0,0,0,0,0,0,0,1,0,0; 0,0,0,0,0,0,0,0,1,0; 0,0,0,0,0,0,0,0,0,1; 1,1,1,1,1,1,1,1,1,1]^(n-1)*[1;1;1;1;1;1;1;1;1;1])[1,1] \\ Charles R Greathouse IV, Jun 15 2015

O.g.f.: x*(-1+x^2+2*x^3+3*x^4+4*x^5+5*x^6+6*x^7+7*x^8+8*x^9) / (-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10). - R. J. Mathar, Nov 23 2007

cp's OEIS Frontend

A127193 A 9th-order Fibonacci sequence.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A122189 Heptanacci numbers: each term is the sum of the preceding 7 terms, with a(0),...,a(6) = 0,0,0,0,0,0,1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A214827 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A214831 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 9.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

SageMath

Formula

A001949 Solutions of a fifth-order probability difference equation.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

Formula

Extensions

A249413 Primes in the hexanacci numbers sequence A000383.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A214828 a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 6.

Views

Author

Keywords