0,1

This 7th-order linear recurrence is a generalization of the Lucas sequence A000032. Mario Catalani would refer to this is a generalized heptanacci sequence, had he not stopped his series of sequences after A001644 "generalized tribonacci", A073817 "generalized tetranacci", A074048 "generalized pentanacci", A074584 "generalized hexanacci." T. D. Noe and I have noted that each of these has many more primes than the corresponding tribonacci A000073 (see A104576), tetranacci A000288 (see A104577), pentanacci, hexanacci and heptanacci (see A104414). For primes in Heptanacci-Lucas numbers, see A104622. For semiprimes in Heptanacci-Lucas numbers, see A104623.

Mario Catalani, "Polymatrix and Generalized Polynacci Numbers", arXiv:math.CO/0210201 v1, 2002

Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.4.

T. D. Noe, Table of n, a(n) for n=0..200

a(0) = 7, a(1) = 1, a(2) = 3, a(3) = 7, a(4) = 15, a(5) = 31, a(6) = 63, for n > 6: a(n) = a(n-1)+a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6)+a(n-7).

G.f.: (-7+6*x+5*x^2+4*x^3+3*x^4+2*x^5+x^6)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7). a(n)= 7*A066178(n)-6*A066178(n-1)-5*A066178(n-2)-...-2*A066178(n-5)-A066178(n-6) if n>=6. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007

a[0] = 7; a[1] = 1; a[2] = 3; a[3] = 7; a[4] = 15; a[5] = 31; a[6] = 63; a[n_] := a[n] = a[n - 1] + a[n - 2] + a[n - 3] + a[n - 4] + a[n - 5] + a[n - 6] + a[n - 7]; Table[ a[n], {n, 0, 32}] (from Robert G. Wilson v Mar 17 2005)

Cf. A000032, A001644, A073817, A074048, A074584, A104414, A104576, A104577.

Sequence in context: A130875 A039616 A089562 this_sequence A048834 A010504 A011450

Adjacent sequences: A104618 A104619 A104620 this_sequence A104622 A104623 A104624

easy,nonn

Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 17 2005