OFFSET
0,2
COMMENTS
Simplest sequence of form a(2n)=c*a(n)+f(n), a(2n+1)=g(n) that cannot be easily expressed as a function of A007814(n).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = sum(k=0..A007814(n), 2^(k+n/2^k) ).
PROG
(PARI) a(n)=sum(k=0, valuation(n, 2), 2^(k+n/2^k))
(PARI) a(n)=if(n<1, 0, if(n%2==0, 2*a(n/2)+2^n, 2^n))
(Haskell)
import Data.List (transpose)
a227326 n = a227326_list !! n
a227326_list = 0 : xs where
xs = concat $ transpose
[a004171_list, zipWith (+) (tail a000302_list) (map (* 2) xs)]
-- Reinhard Zumkeller, Jul 08 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Jul 07 2013
STATUS
approved