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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229278 Number of ascending runs in {1,...,4}^n. 2


%S 0,4,26,144,736,3584,16896,77824,352256,1572864,6946816,30408704,

%T 132120576,570425344,2449473536,10468982784,44560285696,188978561024,

%U 798863917056,3367254360064,14156212207616,59373627899904,248489627877376,1037938976620544

%N Number of ascending runs in {1,...,4}^n.

%H Alois P. Heinz, <a href="/A229278/b229278.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = 2^(2*n-3)*(5*n+3) for n>0, a(0) = 0.

%p a:= n-> `if`(n=0, 0, 2^(2*n-3)*(5*n+3)):

%p seq(a(n), n=0..30);

%Y Column k=4 of A229079.

%K nonn,easy

%O 0,2

%A _Alois P. Heinz_, Sep 18 2013

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 February 17 02:22 EST 2020. Contains 331976 sequences. (Running on oeis4.)