The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”). Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A001020 Powers of 11: a(n) = 11^n. (Formerly M4807 N2054) 77
 1, 11, 121, 1331, 14641, 161051, 1771561, 19487171, 214358881, 2357947691, 25937424601, 285311670611, 3138428376721, 34522712143931, 379749833583241, 4177248169415651, 45949729863572161, 505447028499293771, 5559917313492231481, 61159090448414546291 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 1, a(n) equals the number of 11-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011 a(n), for n <= 4, gives the n-th row of Pascal's triangle (A007318); a(n), n >= 5 "sort of" gives the n-th row of Pascal's triangle, but now the binomial coefficients with more than one digit overlap. - Daniel Forgues, Aug 12 2012 Numbers n such that sigma(11*n) = 11*n + sigma(n). - Jahangeer Kholdi, Nov 13 2013 REFERENCES 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). LINKS 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 Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992. Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992 Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1. Index entries for linear recurrences with constant coefficients, signature (11). FORMULA G.f.: 1/(1-11*x). E.g.f.: exp(11*x). a(n) = 11*a(n-1), n > 0; a(0)=1. - Philippe Deléham, Nov 23 2008 MAPLE A001020:=-1/(-1+11*z); # Simon Plouffe in his 1992 dissertation MATHEMATICA Table[11^n, {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011 *) PROG (MAGMA) [11^n: n in [0..100]]; // Vincenzo Librandi, Apr 24 2011 (Maxima) makelist(11*n, n, 0, 20); /* Martin Ettl, Dec 17 2012 */ (PARI) a(n)=n^11 \\ Charles R Greathouse IV, Sep 24 2015 CROSSREFS Cf. A096884, A097659, A007318. Sequence in context: A045587 A059734 A045582 * A325203 A055479 A195946 Adjacent sequences:  A001017 A001018 A001019 * A001021 A001022 A001023 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 12:17 EST 2021. Contains 349581 sequences. (Running on oeis4.)