Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116549
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116549 a(0) = 1. a(m +2^n) = a(n) + a(m), for 0 <= m <= 2^n -1. +0
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; listen)
OFFSET

0,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

CROSSREFS

Sequence in context: A154951 A095769 A080820 this_sequence A107079 A025528 A123580

Adjacent sequences: A116546 A116547 A116548 this_sequence A116550 A116551 A116552

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Mar 16 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research