This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074600 a(n) = 2^n + 5^n. 54
 2, 7, 29, 133, 641, 3157, 15689, 78253, 390881, 1953637, 9766649, 48830173, 244144721, 1220711317, 6103532009, 30517610893, 152587956161, 762939584197, 3814697527769, 19073486852413, 95367432689201, 476837160300277 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Digital root of a(n) is A010697(n). - Peter M. Chema, Oct 24 2016 REFERENCES Miller, Steven J., ed. Benford's Law: Theory and Applications. Princeton University Press, 2015. See page 14. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 D. Suprijanto, I. W. Suwarno, Observation on Sums of Powers of Integers Divisible by 3k-1, Applied Mathematical Sciences, Vol. 8, 2014, no. 45, pp. 2211-2217. Index entries for linear recurrences with constant coefficients, signature (7,-10). FORMULA a(n) = 5*a(n-1)-3*2^(n-1) = 7*a(n-1)- 10*a(n-2). [Corrected by Zak Seidov, Oct 24 2009] G.f.: 1/(1-2*x)+1/(1-5*x). E.g.f.: e^(2*x)+e^(5*x). - Mohammad K. Azarian, Jan 02 2009 MATHEMATICA Table[2^n + 5^n, {n, 0, 25}] PROG (MAGMA) [2^n + 5^n: n in [0..35]]; // Vincenzo Librandi, Apr 30 2011 (PARI) a(n)=2^n+5^n \\ Charles R Greathouse IV, Sep 24 2015 CROSSREFS Cf. A000051, A034472, A052539, A034474, A062394, A034491, A062395, A062396, A007689, A063376, A063481, A074601-A074624, A010697. Sequence in context: A300048 A232971 A110576 * A064641 A183608 A104252 Adjacent sequences:  A074597 A074598 A074599 * A074601 A074602 A074603 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Aug 25 2002 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 17 03:29 EDT 2018. Contains 313810 sequences. (Running on oeis4.)