login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191007 Another renewal type of sequence: Let X, X(1),X(2),... denote independent random variables with pdf P(X=1) = P(X=2) = P(X=4) = 1/3. Let N(x) denote the first value of k such that X(1)*X(2)...*X(k) > x, and let H(x) = E(N(x)). The sequence a(n) is given by a(n) = 2^(n+1)*H(2^n). 0
3, 9, 27, 69, 171, 405, 939, 2133, 4779, 10581, 23211, 50517, 109227, 234837, 502443, 1070421, 2271915, 4805973, 10136235, 21321045, 44739243, 93672789, 195734187, 408245589, 850045611, 1767200085, 3668617899, 7605671253, 15748213419, 32570168661, 67287820971 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..30.

E. Omey, Another renewal type of sequence, Unpublished report.

Index entries for linear recurrences with constant coefficients, signature (3,0,-4).

FORMULA

a(n) = n*2^(n+1) + (2^(n+3)+(-1)^n)/3.

a(n) = 3 * A045883(n+1).

G.f.: 3/((1 + x)*(1 - 2*x)^2). [Bruno Berselli, Oct 16 2014]

MATHEMATICA

Table[n 2^(n + 1) + (2^(n + 3) + (-1)^n)/3, {n, 0, 70}] (* Vincenzo Librandi, Oct 16 2014 *)

PROG

(PARI) a(n) = n*2^(n+1) + (2^(n+3)+(-1)^n)/3; \\ Michel Marcus, Oct 16 2014

(MAGMA) [n*2^(n+1)+(2^(n+3)+(-1)^n)/3: n in [0..30]]; // Vincenzo Librandi, Oct 16 2014

CROSSREFS

3 times A045883.

Sequence in context: A161712 A280466 A137368 * A036215 A103828 A110740

Adjacent sequences:  A191004 A191005 A191006 * A191008 A191009 A191010

KEYWORD

nonn,easy

AUTHOR

Edward Omey, Jun 16 2011

EXTENSIONS

Formula corrected and more terms from Michel Marcus, Oct 16 2014

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 00:32 EDT 2020. Contains 336403 sequences. (Running on oeis4.)