# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a000420
Showing 1-1 of 1
%I A000420 M4431 N1874 #104 Jul 12 2023 12:20:37
%S A000420 1,7,49,343,2401,16807,117649,823543,5764801,40353607,282475249,
%T A000420 1977326743,13841287201,96889010407,678223072849,4747561509943,
%U A000420 33232930569601,232630513987207,1628413597910449,11398895185373143,79792266297612001,558545864083284007
%N A000420 Powers of 7: a(n) = 7^n.
%C A000420 Same as Pisot sequences E(1, 7), L(1, 7), P(1, 7), T(1, 7). Essentially same as Pisot sequences E(7, 49), L(7, 49), P(7, 49), T(7, 49). See A008776 for definitions of Pisot sequences.
%C A000420 Sum of coefficients of expansion of (1+x+x^2+x^3+x^4+x^5+x^6)^n.
%C A000420 a(n) is number of compositions of natural numbers into n parts < 7.
%C A000420 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 7-colored compositions of n such that no adjacent parts have the same color. - _Milan Janjic_, Nov 17 2011
%C A000420 Numbers n such that sigma(7n) = 7n + sigma(n). - _Jahangeer Kholdi_, Nov 23 2013
%C A000420 Number of ways to assign truth values to n ternary disjunctions connected by conjunctions such that the proposition is true. For example, a(2) = 49, since for the proposition '(a v b v c) & (d v e v f)' there are 49 assignments that make the proposition true. - _Ori Milstein_, Dec 31 2022
%C A000420 Equivalently, the number of length-n words over an alphabet with seven letters. - _Joerg Arndt_, Jan 01 2023
%D A000420 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000420 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000420 T. D. Noe, Table of n, a(n) for n = 0..100
%H A000420 P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
%H A000420 INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 272
%H A000420 Tanya Khovanova, Recursive Sequences
%H A000420 Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H A000420 Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
%H A000420 Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
%H A000420 Index entries for linear recurrences with constant coefficients, signature (7).
%F A000420 a(n) = 7^n.
%F A000420 a(0) = 1; a(n) = 7*a(n-1).
%F A000420 G.f.: 1/(1-7*x).
%F A000420 E.g.f.: exp(7*x).
%F A000420 4/7 - 5/7^2 + 4/7^3 - 5/7^4 + ... = 23/48. [Jolley, Summation of Series, Dover, 1961]
%e A000420 a(2)=49 there are 49 compositions of natural numbers into 2 parts < 7.
%p A000420 A000420:=-1/(-1+7*z); # _Simon Plouffe_ in his 1992 dissertation. [This is actually the generating function, so convert(series(...),list) would yield the actual sequence. - _M. F. Hasler_, Apr 19 2015]
%p A000420 A000420 := n -> 7^n; # _M. F. Hasler_, Apr 19 2015
%t A000420 Table[7^n, {n,0,50}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 15 2011 *)
%o A000420 (Maxima) makelist(7^n,n,0,20); /* _Martin Ettl_, Dec 27 2012 */
%o A000420 (Haskell)
%o A000420 a000420 = (7 ^)
%o A000420 a000420_list = iterate (* 7) 1 -- _Reinhard Zumkeller_, Apr 29 2015
%o A000420 (PARI) a(n)=7^n \\ _Charles R Greathouse IV_, Jul 28 2015
%o A000420 (Magma) [7^n : n in [0..30]]; // _Wesley Ivan Hurt_, Sep 27 2016
%Y A000420 Cf. A000079 (powers of 2), A000244 (powers of 3), A000302 (powers of 4), A000351 (powers of 5), A000400 (powers of 6), A001018 (powers of 8), ..., A001029 (powers of 19), A009964 (powers of 20), ..., A009992 (powers of 48), A087752 (powers of 49).
%K A000420 nonn,easy
%O A000420 0,2
%A A000420 _N. J. A. Sloane_
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE