A164090 a(n) = 2*a(n-2) for n > 2; a(1) = 2, a(2) = 3.
2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576, 32768, 49152, 65536, 98304, 131072, 196608, 262144, 393216, 524288, 786432, 1048576, 1572864, 2097152, 3145728
Offset: 1
Links
- Vincenzo Librandi, Table of n, a(n) for n = 1..2000
- Index entries for linear recurrences with constant coefficients, signature (0,2).
Crossrefs
Programs
-
Magma
[ n le 2 select n+1 else 2*Self(n-2): n in [1..42] ];
-
Mathematica
a[n_] := If[EvenQ[n], 3*2^(n/2 - 1), 2^((n + 1)/2)]; Array[a, 42] (* Jean-François Alcover, Oct 12 2017 *) RecurrenceTable[{a[1]==2,a[2]==3,a[n]==2a[n-2]},a,{n,50}] (* or *) LinearRecurrence[{0,2},{2,3},50] (* Harvey P. Dale, Mar 01 2018 *)
-
PARI
a(n) = if(n%2,2,3) * 2^((n-1)\2); \\ Andrew Howroyd, Oct 07 2017
Formula
a(n) = A029744(n+1).
a(n) = A052955(n-1) + 1.
a(n) = A027383(n-2) + 2 for n > 1.
a(n) = A060482(n-1) + 3 for n > 3.
a(n) = (7 - (-1)^n)*2^((1/4)*(2*n - 1 + (-1)^n))/4.
G.f.: x*(2+3*x)/(1-2*x^2).
a(n) = A063759(n-1), n>1. - R. J. Mathar, Aug 17 2009
Sum_{n>=1} 1/a(n) = 5/3. - Amiram Eldar, Mar 28 2022
Comments