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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116549 a(0) = 1. a(m +2^n) = a(n) + a(m), for 0 <= m <= 2^n -1. 1
1, 2, 3, 4, 4, 5, 6, 7, 5, 6, 7, 8, 8, 9, 10, 11, 5, 6, 7, 8, 8, 9, 10, 11, 9, 10, 11, 12, 12, 13, 14, 15, 6, 7, 8, 9, 9, 10, 11, 12, 10, 11, 12, 13, 13, 14, 15, 16, 10, 11, 12, 13, 13, 14, 15, 16, 14, 15, 16, 17, 17, 18, 19, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

For n > 0: a(n) = a(A000523(n)) + a(A053645(n)). - Reinhard Zumkeller, Aug 27 2014

PROG

(Haskell)

import Data.Function (on); import Data.List (genericIndex)

a116549 = genericIndex a116549_list

a116549_list = 1 : zipWith ((+) `on` a116549) a000523_list a053645_list

-- Reinhard Zumkeller, Aug 27 2014

CROSSREFS

Cf. A000523, A053645.

Sequence in context: A234604 A236346 A306890 * A268382 A107079 A025528

Adjacent sequences:  A116546 A116547 A116548 * A116550 A116551 A116552

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Mar 16 2006

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 April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)