Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116362
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116362 Smallest m such that A116361(m) = n. +0
2
0, 1, 3, 7, 11, 23, 39, 79, 143, 287, 543, 1087, 2111, 4223, 8319, 16639, 33023, 66047, 131583, 263167, 525311, 1050623, 2099199, 4198399, 8392703, 16785407, 33562623, 67125247, 134234111, 268468223, 536903679, 1073807359 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) = 2*a(n-1) + 1 - 0^(n mod 2) * 2^floor(n/2) for n>2.

FORMULA

a(n) = 2^(n-1) + 2^floor((n+1)/2) - 1 for n > 1.

CROSSREFS

Sequence in context: A095102 A112715 A106935 this_sequence A090918 A139253 A116606

Adjacent sequences: A116359 A116360 A116361 this_sequence A116363 A116364 A116365

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 04 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research