0,2

Number of n-permutations of 12 objects: o, p, q, r, s, t, u, v, w, z, x, y with repetition allowed and containing no u's. Permutations with repetitions! If n=0 then 1 >> 11^0=1 >> "" . (no u's) If n=1 then 11 >> 11^1=11, >> o, p, q, r, s, t, v, w, z, x, y. . (no u's) etc. (Thanks Emeric Deutsch!) [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 29 2009]

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 275

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.

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

a(n)=11*a(n-1), n>0 ; a(0)=1 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]

A001020:=-1/(-1+11*z); [S. Plouffe in his 1992 dissertation.]

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

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

Sequence in context: A045587 A059734 A045582 this_sequence A055479 A003590 A072051

Adjacent sequences: A001017 A001018 A001019 this_sequence A001021 A001022 A001023

nonn

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

More terms from Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 06 2009