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!)
 A196305 a(n) = 15*2^n - 1. 2

%I

%S 14,29,59,119,239,479,959,1919,3839,7679,15359,30719,61439,122879,

%T 245759,491519,983039,1966079,3932159,7864319,15728639,31457279,

%U 62914559,125829119,251658239,503316479,1006632959,2013265919,4026531839,8053063679,16106127359

%N a(n) = 15*2^n - 1.

%C Primes of this sequence are in A196940.

%H Vincenzo Librandi, <a href="/A196305/b196305.txt">Table of n, a(n) for n = 0..200</a>

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

%F a(n) = 15*2^n - 1.

%F a(n) = A033484(n+1) + A083705(n).

%F From _Philippe Deléham_, Feb 17 2014: (Start)

%F a(n) = 2*a(n-1) + 1.

%F a(n) = 3*a(n-2) - 2*a(n-2). (End)

%F a(n) = A110286(n) - 1. - _Philippe Deléham_, Feb 17 2014

%o (MAGMA) [15*2^n -1 : n in [0..50]];

%o (PARI) a(n)=15<<n-1 \\ _Charles R Greathouse IV_, Oct 08 2011

%Y Cf. A033484, A083705, A110286 (first differences).

%K nonn,easy

%O 0,1

%A _Brad Clardy_, Oct 07 2011

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 August 8 08:27 EDT 2020. Contains 336293 sequences. (Running on oeis4.)