login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087069 a(n) = Sum{Floor(n/(4^k): k>=0). 1
0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 21, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 34, 36, 37, 38, 39, 42, 43, 44, 45, 47, 48, 49, 50, 52, 53, 54, 55, 57, 58, 59, 60, 63, 64, 65, 66, 68, 69, 70, 71, 73, 74, 75, 76, 78, 79, 80, 81, 85, 86, 87, 88, 90, 91, 92, 93 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

FORMULA

a(n)=Sum_k>=0 {A030308(n,k)*A000975(k+1)}. - From DELEHAM Philippe, Oct 16 2011.

EXAMPLE

a(4)=5=4+[4/4]+[4/16]+[4/64]+...

PROG

(Haskell)

import Data.List (unfoldr)

a087069 =

   sum . unfoldr (\x -> if x == 0 then Nothing else Just (x, x `div` 4))

-- Reinhard Zumkeller, Apr 22 2011

CROSSREFS

Cf. A005187.

Sequence in context: A039145 A038129 A062071 * A023737 A037459 A020654

Adjacent sequences:  A087066 A087067 A087068 * A087070 A087071 A087072

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Aug 07 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.