login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A171494 a(n) = 2*a(n-1) for n > 1; a(0) = 6, a(1) = 16. 3

%I #4 Jun 29 2023 12:56:38

%S 6,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,

%T 262144,524288,1048576,2097152,4194304,8388608,16777216,33554432,

%U 67108864,134217728,268435456,536870912,1073741824,2147483648

%N a(n) = 2*a(n-1) for n > 1; a(0) = 6, a(1) = 16.

%C 16*A000079 preceded by 6.

%C Binomial transform of A010726.

%C Inverse binomial transform of A171495.

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (2).

%F a(n) = 2^(n+3) for n > 0; a(0) = 6.

%F G.f.: 2*(3+2*x)/(1-2*x).

%o (PARI) {m=29; v=concat([6, 16], vector(m-2)); for(n=3, m, v[n]=2*v[n-1]); v}

%Y Equals 2*A171497.

%Y Cf. A000079 (powers of 2), A010726 (repeat 6, 10), A171495.

%K nonn

%O 0,1

%A _Klaus Brockhaus_, Dec 10 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)