0,2

Same as Pisot sequences E(1,7), L(1,7), P(1,7), T(1,7). See A008776 for definitions of Pisot sequences.

With a different offset, number of n-permutations (n>=0) of 8 objects: s, t, u, v, w, z, x, y with repetition allowed, containing exactly zero (0) or free u's. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 15 2008

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

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 272

Tanya Khovanova, Recursive Sequences

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.

Index entries for sequences related to linear recurrences with constant coefficients

a(n) = 7^n; a(n) = 7a(n-1).

G.f.: 1/(1-7x), e.g.f.: exp(7x)

A000420:=-1/(-1+7*z); [Conjectured by S. Plouffe in his 1992 dissertation.]

with(finance):seq(futurevalue(1, 6, n), n=0..21); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 25 2009]

(Other) sage: [lucas_number1(n, 7, 0) for n in xrange(1, 23)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 23 2009]

Sequence in context: A124536 A045578 A126627 this_sequence A050737 A033143 A024582

Adjacent sequences: A000417 A000418 A000419 this_sequence A000421 A000422 A000423

nonn,easy

N. J. A. Sloane (njas(AT)research.att.com).