|
Search: id:A006696
|
|
|
| A006696 |
|
a(n) = min_{k=1..n} (a(k-1) + 2^k*(n+a(n-k)).
(Formerly M1836)
|
|
+0
1
|
|
| 2, 8, 22, 50, 110, 226, 464, 938, 1888, 3794, 7598, 15208, 30438, 60890, 121792, 243606, 487238, 974488, 1948998, 3898034, 7796078, 15592168, 31184358, 62368754, 124737534
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. V. Connolly and W. J. Knight, ``Search in an array in which probe costs grow exponentially or factorially,'' preprint, 1990.
|
|
CROSSREFS
|
Sequence in context: A153827 A137101 A094533 this_sequence A094939 A006732 A005803
Adjacent sequences: A006693 A006694 A006695 this_sequence A006697 A006698 A006699
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
Jeffrey Shallit, N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
