The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104743 Numbers m = n + 3^n such that the equation x = 3^(m-x) has solution x = 3^n. 14
 1, 4, 11, 30, 85, 248, 735, 2194, 6569, 19692, 59059, 177158, 531453, 1594336, 4782983, 14348922, 43046737, 129140180, 387420507, 1162261486, 3486784421, 10460353224, 31381059631, 94143178850, 282429536505, 847288609468 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS This sequence also describes the total number of moves solving (non-optimally) the [RED ; NEUTRAL ; NEUTRAL] or [NEUTRAL ; NEUTRAL ; BLUE] pre-colored Magnetic Tower of Hanoi puzzle (see the "CROSSREFS" in A183121). For other Magnetic Tower of Hanoi related sequences, cf. A183111 - A183125. The allowable number of dimensions in supersymmetric geometries, according to Thad Roberts. - Howard A. Landman, Jan 09 2013 Form an infinite array with m(0,k) = 2*k+1 and m(n,k) = Sum_{r=0..n-1} m(r,k) + Sum_{c=0..k-1} m(n,c), being the sum of the terms above m(n,k) plus those terms to the left of m(n,k). The first row is A005408. The second row is A033484. The first column is A011782. The sum of the terms in the n-th antidiagonal is a(n). - J. M. Bergot, Jun 07 2013 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Uri Levy, The Magnetic Tower of Hanoi, arXiv:1003.0225 [math.CO], 2010. Thad Roberts, Quantum Space Theory. Index entries for linear recurrences with constant coefficients, signature (5,-7,3). FORMULA a(n) = n + 3^n. From Colin Barker, Jan 25 2012: (Start) a(n) = 5*a(n-1) - 7*a(n-2) + 3*a(n-3). G.f.: (1+x)*(1-2*x) / ((1-3*x)*(1-x)^2). (End) E.g.f.: x*exp(x) + exp(3*x). - G. C. Greubel, May 21 2019 MAPLE g:=1/(1-3*z): gser:=series(g, z=0, 43): seq(coeff(gser, z, n)+n, n=0..31); #  Zerinvary Lajos, Jan 09 2009 MATHEMATICA Table[3^n +n, {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Jan 18 2009, modified by G. C. Greubel, May 21 2019 *) PROG (PARI) {a(n) = 3^n + n}; \\ G. C. Greubel, May 21 2019 (MAGMA) [3^n +n: n in [0..40]]; // G. C. Greubel, May 21 2019 (Sage) [3^n +n for n in (0..40)] # G. C. Greubel, May 21 2019 (GAP) List([0..40], n-> 3^n +n ) # G. C. Greubel, May 21 2019 CROSSREFS Cf. A103537. Sequence in context: A183123 A183116 A183121 * A165993 A192312 A004080 Adjacent sequences:  A104740 A104741 A104742 * A104744 A104745 A104746 KEYWORD nonn,easy AUTHOR Zak Seidov, Mar 23 2005 EXTENSIONS More terms from Vladimir Joseph Stephan Orlovsky, Jan 18 2009 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 March 29 02:19 EDT 2020. Contains 333104 sequences. (Running on oeis4.)