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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #38 Sep 08 2022 08:44:29
%S 10,40,160,640,2560,10240,40960,163840,655360,2621440,10485760,
%T 41943040,167772160,671088640,2684354560,10737418240,42949672960,
%U 171798691840,687194767360,2748779069440,10995116277760,43980465111040,175921860444160,703687441776640
%N a(n) = 10*4^n.
%H Vincenzo Librandi, <a href="/A002066/b002066.txt">Table of n, a(n) for n = 0..500</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (4).
%F From _Philippe Deléham_, Nov 23 2008: (Start)
%F a(n) = 4*a(n-1), n > 0; a(0)=10.
%F G.f.: 10/(1-4*x). (End)
%t 10*4^Range[0, 100] (* _Vladimir Joseph Stephan Orlovsky_, Jun 09 2011 *)
%o (Magma) [10*4^n: n in [0..30]]; // _Vincenzo Librandi_, May 19 2011
%o (PARI) a(n)=10*4^n \\ _Charles R Greathouse IV_, Apr 18 2012
%Y Pairwise sums of A081294
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_