%I A001020 M4807 N2054
%S A001020 1,11,121,1331,14641,161051,1771561,19487171,214358881,2357947691,
%T A001020 25937424601,285311670611,3138428376721,34522712143931,379749833583241,
%U A001020 4177248169415651,45949729863572161,505447028499293771,5559917313492231481,
               61159090448414546291,672749994932560009201,7400249944258160101211
%N A001020 Powers of 11.
%C A001020 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]
%D A001020 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001020 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A001020 T. D. Noe, <a href="b001020.txt">Table of n, a(n) for n=0..100</a>
%H A001020 P. J. Cameron, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">
               Sequences realized by oligomorphic permutation groups</a>, J. Integ. 
               Seqs. Vol. 3 (2000), #00.1.5.
%H A001020 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=275">
               Encyclopedia of Combinatorial Structures 275</a>
%H A001020 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%H A001020 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">
               Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures</
               a>, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%H A001020 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">
               1031 Generating Functions and Conjectures</a>, Universit\'{e} du 
               Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
%H A001020 Y. Puri and T. Ward, <a href="http://www.cs.uwaterloo.ca/journals/JIS/
               index.html">Arithmetic and growth of periodic orbits</a>, J. Integer 
               Seqs., Vol. 4 (2001), #01.2.1.
%F A001020 G.f.: 1/(1-11x), e.g.f.: exp(11x)
%F A001020 a(n)=11*a(n-1), n>0 ; a(0)=1 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), 
               Nov 23 2008]
%p A001020 A001020:=-1/(-1+11*z); [S. Plouffe in his 1992 dissertation.]
%p A001020 with(finance):seq(futurevalue(1,10,n), n=0..17);# [From Zerinvary Lajos 
               (zerinvarylajos(AT)yahoo.com), Mar 25 2009]
%o A001020 (Other) sage: [lucas_number1(n,11,0) for n in xrange(1, 19)]# [From Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), Apr 26 2009]
%Y A001020 Sequence in context: A045587 A059734 A045582 this_sequence A055479 A003590 
               A072051
%Y A001020 Adjacent sequences: A001017 A001018 A001019 this_sequence A001021 A001022 
               A001023
%K A001020 nonn
%O A001020 0,2
%A A001020 N. J. A. Sloane (njas(AT)research.att.com).
%E A001020 More terms from Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 
               06 2009